/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:11:21,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:11:21,171 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:11:21,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:11:21,183 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:11:21,184 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:11:21,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:11:21,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:11:21,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:11:21,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:11:21,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:11:21,191 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:11:21,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:11:21,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:11:21,193 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:11:21,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:11:21,195 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:11:21,196 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:11:21,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:11:21,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:11:21,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:11:21,202 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:11:21,203 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:11:21,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:11:21,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:11:21,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:11:21,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:11:21,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:11:21,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:11:21,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:11:21,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:11:21,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:11:21,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:11:21,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:11:21,211 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:11:21,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:11:21,212 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:11:21,212 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:11:21,212 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:11:21,213 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:11:21,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:11:21,215 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:11:21,229 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:11:21,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:11:21,231 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:11:21,231 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:11:21,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:11:21,231 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:11:21,231 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:11:21,231 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:11:21,232 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:11:21,232 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:11:21,232 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:11:21,232 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:11:21,232 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:11:21,233 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:11:21,233 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:21,233 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:11:21,233 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:11:21,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:11:21,233 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:11:21,234 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:11:21,234 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:11:21,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:11:21,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:11:21,234 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:11:21,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:11:21,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:11:21,235 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:11:21,235 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:11:21,235 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:11:21,400 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:11:21,414 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:11:21,417 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:11:21,419 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:11:21,419 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:11:21,420 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:11:21,483 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_xUusCT/tmp/4627239434c646afb7fcc26caa0329bb/FLAG85baeefa2 [2020-07-01 12:11:21,814 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:11:21,815 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:11:21,822 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_xUusCT/tmp/4627239434c646afb7fcc26caa0329bb/FLAG85baeefa2 [2020-07-01 12:11:22,234 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_xUusCT/tmp/4627239434c646afb7fcc26caa0329bb [2020-07-01 12:11:22,245 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:11:22,247 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:11:22,248 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:11:22,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:11:22,252 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:11:22,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:11:22" (1/1) ... [2020-07-01 12:11:22,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74be0ec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:11:22, skipping insertion in model container [2020-07-01 12:11:22,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:11:22" (1/1) ... [2020-07-01 12:11:22,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:11:22,281 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:11:22,505 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:11:22,509 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:11:22,526 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:11:22,541 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:11:22,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:11:22 WrapperNode [2020-07-01 12:11:22,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:11:22,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:11:22,542 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:11:22,543 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:11:22,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:11:22" (1/1) ... [2020-07-01 12:11:22,558 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:11:22" (1/1) ... [2020-07-01 12:11:22,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:11:22,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:11:22,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:11:22,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:11:22,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:11:22" (1/1) ... [2020-07-01 12:11:22,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:11:22" (1/1) ... [2020-07-01 12:11:22,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:11:22" (1/1) ... [2020-07-01 12:11:22,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:11:22" (1/1) ... [2020-07-01 12:11:22,591 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:11:22" (1/1) ... [2020-07-01 12:11:22,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:11:22" (1/1) ... [2020-07-01 12:11:22,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:11:22" (1/1) ... [2020-07-01 12:11:22,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:11:22,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:11:22,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:11:22,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:11:22,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:11:22" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:11:22,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:11:22,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:11:22,823 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:11:22,823 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 12:11:22,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:11:22 BoogieIcfgContainer [2020-07-01 12:11:22,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:11:22,827 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:11:22,827 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:11:22,829 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:11:22,830 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:11:22" (1/1) ... [2020-07-01 12:11:22,842 INFO L313 BlockEncoder]: Initial Icfg 7 locations, 9 edges [2020-07-01 12:11:22,844 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:11:22,845 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:11:22,845 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:11:22,845 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:11:22,847 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:11:22,848 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:11:22,848 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:11:22,862 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:11:22,869 INFO L200 BlockEncoder]: SBE split 0 edges [2020-07-01 12:11:22,875 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:11:22,876 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:11:22,897 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2020-07-01 12:11:22,899 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:11:22,901 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:11:22,901 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:11:22,901 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:11:22,901 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:11:22,902 INFO L313 BlockEncoder]: Encoded RCFG 3 locations, 4 edges [2020-07-01 12:11:22,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:11:22 BasicIcfg [2020-07-01 12:11:22,902 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:11:22,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:11:22,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:11:22,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:11:22,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:11:22" (1/4) ... [2020-07-01 12:11:22,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3384f625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:11:22, skipping insertion in model container [2020-07-01 12:11:22,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:11:22" (2/4) ... [2020-07-01 12:11:22,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3384f625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:11:22, skipping insertion in model container [2020-07-01 12:11:22,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:11:22" (3/4) ... [2020-07-01 12:11:22,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3384f625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:11:22, skipping insertion in model container [2020-07-01 12:11:22,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:11:22" (4/4) ... [2020-07-01 12:11:22,911 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:11:22,922 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:11:22,929 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-07-01 12:11:22,942 INFO L251 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-07-01 12:11:22,965 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:11:22,965 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:11:22,966 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:11:22,966 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:11:22,966 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:11:22,966 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:11:22,966 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:11:22,966 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:11:22,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3 states. [2020-07-01 12:11:22,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:11:22,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. [2020-07-01 12:11:23,040 INFO L268 CegarLoopResult]: For program point L15(lines 15 21) no Hoare annotation was computed. [2020-07-01 12:11:23,040 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:11:23,041 INFO L271 CegarLoopResult]: At program point L15-2(lines 14 22) the Hoare annotation is: true [2020-07-01 12:11:23,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:11:23 BasicIcfg [2020-07-01 12:11:23,049 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:11:23,050 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:11:23,050 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:11:23,054 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:11:23,055 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:11:23,055 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:11:22" (1/5) ... [2020-07-01 12:11:23,055 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bd8c929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:11:23, skipping insertion in model container [2020-07-01 12:11:23,056 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:11:23,056 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:11:22" (2/5) ... [2020-07-01 12:11:23,056 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bd8c929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:11:23, skipping insertion in model container [2020-07-01 12:11:23,056 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:11:23,056 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:11:22" (3/5) ... [2020-07-01 12:11:23,057 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bd8c929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:11:23, skipping insertion in model container [2020-07-01 12:11:23,057 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:11:23,057 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:11:22" (4/5) ... [2020-07-01 12:11:23,057 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bd8c929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:11:23, skipping insertion in model container [2020-07-01 12:11:23,058 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:11:23,058 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:11:23" (5/5) ... [2020-07-01 12:11:23,059 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:11:23,088 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:11:23,088 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:11:23,088 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:11:23,088 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:11:23,088 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:11:23,089 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:11:23,089 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:11:23,089 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:11:23,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-01 12:11:23,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-01 12:11:23,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:11:23,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:11:23,117 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-01 12:11:23,117 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 12:11:23,117 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:11:23,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-01 12:11:23,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-01 12:11:23,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:11:23,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:11:23,118 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-01 12:11:23,118 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 12:11:23,123 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [26] ULTIMATE.startENTRY-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~c~0] 5#L15-2true [2020-07-01 12:11:23,124 INFO L796 eck$LassoCheckResult]: Loop: 5#L15-2true [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 3#L15true [34] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 5#L15-2true [2020-07-01 12:11:23,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:23,131 INFO L82 PathProgramCache]: Analyzing trace with hash 57, now seen corresponding path program 1 times [2020-07-01 12:11:23,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:11:23,140 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600075307] [2020-07-01 12:11:23,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:11:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:23,216 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:11:23,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:23,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1956, now seen corresponding path program 1 times [2020-07-01 12:11:23,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:11:23,218 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702193261] [2020-07-01 12:11:23,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:11:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:23,236 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:11:23,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:23,238 INFO L82 PathProgramCache]: Analyzing trace with hash 55772, now seen corresponding path program 1 times [2020-07-01 12:11:23,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:11:23,238 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26209589] [2020-07-01 12:11:23,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:11:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:23,253 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:11:23,301 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 12:11:23,302 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 12:11:23,302 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 12:11:23,302 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 12:11:23,302 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 12:11:23,303 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:23,303 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 12:11:23,303 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 12:11:23,303 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 12:11:23,303 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 12:11:23,304 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 12:11:23,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:23,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:23,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:23,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:23,445 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 12:11:23,446 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:23,454 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 12:11:23,454 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:23,493 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 12:11:23,493 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 12:11:23,510 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 12:11:23,510 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=1} Honda state: {ULTIMATE.start_main_~c~0=1} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=1}, {ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [1, 10, 14] Nus: [1, 0] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:23,544 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 12:11:23,545 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 12:11:23,550 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 12:11:23,550 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:23,584 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 12:11:23,584 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 12:11:23,589 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 12:11:23,589 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:23,623 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 12:11:23,623 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:23,661 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 12:11:23,661 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 12:11:23,698 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 12:11:23,701 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 12:11:23,701 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 12:11:23,701 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 12:11:23,701 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 12:11:23,701 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 12:11:23,701 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:23,701 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 12:11:23,702 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 12:11:23,702 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 12:11:23,702 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 12:11:23,702 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 12:11:23,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:23,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:23,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:23,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:23,794 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 12:11:23,800 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:23,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:11:23,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:11:23,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:11:23,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:11:23,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:11:23,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:11:23,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:11:23,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:11:23,817 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:23,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:11:23,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:11:23,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:11:23,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:11:23,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:11:23,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:11:23,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:11:23,863 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:23,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:11:23,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:11:23,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:11:23,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:11:23,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:11:23,904 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:11:23,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:11:23,909 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:23,943 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:11:23,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:11:23,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:11:23,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:11:23,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:11:23,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:11:23,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:11:23,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:11:23,951 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 12:11:23,956 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 12:11:23,956 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:23,963 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 12:11:23,963 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 12:11:23,963 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 12:11:23,964 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 211 Supporting invariants [] [2020-07-01 12:11:23,998 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 12:11:24,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:24,040 INFO L264 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 12:11:24,041 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:24,054 WARN L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:11:24,054 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:24,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:11:24,069 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization [2020-07-01 12:11:24,074 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-01 12:11:24,076 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 3 states. Second operand 3 states. [2020-07-01 12:11:24,106 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 3 states.. Second operand 3 states. Result 7 states and 10 transitions. Complement of second has 4 states. [2020-07-01 12:11:24,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-01 12:11:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-01 12:11:24,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-07-01 12:11:24,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 2 letters. [2020-07-01 12:11:24,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:11:24,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. [2020-07-01 12:11:24,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:11:24,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 4 letters. [2020-07-01 12:11:24,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:11:24,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 10 transitions. [2020-07-01 12:11:24,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-01 12:11:24,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 10 transitions. [2020-07-01 12:11:24,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-07-01 12:11:24,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-01 12:11:24,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2020-07-01 12:11:24,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 12:11:24,127 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-01 12:11:24,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2020-07-01 12:11:24,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-07-01 12:11:24,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-01 12:11:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2020-07-01 12:11:24,156 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-01 12:11:24,156 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-01 12:11:24,156 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-01 12:11:24,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2020-07-01 12:11:24,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-01 12:11:24,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:11:24,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:11:24,158 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 12:11:24,158 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 12:11:24,158 INFO L794 eck$LassoCheckResult]: Stem: 45#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~c~0] 46#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 41#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 42#L15-2 [2020-07-01 12:11:24,158 INFO L796 eck$LassoCheckResult]: Loop: 42#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 47#L15 [34] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 42#L15-2 [2020-07-01 12:11:24,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:24,159 INFO L82 PathProgramCache]: Analyzing trace with hash 55762, now seen corresponding path program 1 times [2020-07-01 12:11:24,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:11:24,159 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022127218] [2020-07-01 12:11:24,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:11:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:24,170 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:11:24,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:24,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1956, now seen corresponding path program 2 times [2020-07-01 12:11:24,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:11:24,171 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861991352] [2020-07-01 12:11:24,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:11:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:24,180 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:11:24,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:24,180 INFO L82 PathProgramCache]: Analyzing trace with hash 53588277, now seen corresponding path program 1 times [2020-07-01 12:11:24,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:11:24,181 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449899773] [2020-07-01 12:11:24,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:11:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:24,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:11:24,224 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449899773] [2020-07-01 12:11:24,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:11:24,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:11:24,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820293775] [2020-07-01 12:11:24,247 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 12:11:24,247 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 12:11:24,248 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 12:11:24,248 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 12:11:24,248 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 12:11:24,248 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:24,248 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 12:11:24,248 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 12:11:24,248 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-07-01 12:11:24,248 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 12:11:24,249 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 12:11:24,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:24,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:24,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:24,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:24,355 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 12:11:24,356 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:24,361 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 12:11:24,361 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 12:11:24,367 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 12:11:24,367 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:24,426 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 12:11:24,426 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:24,470 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 12:11:24,470 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 12:11:24,508 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 12:11:24,510 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 12:11:24,510 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 12:11:24,511 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 12:11:24,511 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 12:11:24,511 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 12:11:24,511 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:24,511 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 12:11:24,511 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 12:11:24,511 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-07-01 12:11:24,511 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 12:11:24,512 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 12:11:24,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:24,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:24,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:24,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:24,598 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 12:11:24,599 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:24,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:11:24,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:11:24,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:11:24,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:11:24,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:11:24,609 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:11:24,610 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:11:24,614 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:24,649 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:11:24,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:11:24,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:11:24,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:11:24,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:11:24,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:11:24,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:11:24,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:11:24,657 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 12:11:24,660 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 12:11:24,660 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:24,670 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 12:11:24,670 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 12:11:24,670 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 12:11:24,670 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 211 Supporting invariants [] [2020-07-01 12:11:24,702 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 12:11:24,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:24,724 INFO L264 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 12:11:24,724 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:24,732 WARN L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:11:24,732 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:24,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:11:24,733 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization [2020-07-01 12:11:24,733 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-01 12:11:24,734 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-01 12:11:24,744 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 9 states and 13 transitions. Complement of second has 4 states. [2020-07-01 12:11:24,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-01 12:11:24,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-01 12:11:24,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-07-01 12:11:24,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. [2020-07-01 12:11:24,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:11:24,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-01 12:11:24,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:11:24,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 4 letters. [2020-07-01 12:11:24,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:11:24,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 13 transitions. [2020-07-01 12:11:24,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 12:11:24,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 13 transitions. [2020-07-01 12:11:24,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-07-01 12:11:24,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-01 12:11:24,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2020-07-01 12:11:24,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 12:11:24,751 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2020-07-01 12:11:24,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2020-07-01 12:11:24,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 5. [2020-07-01 12:11:24,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-01 12:11:24,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2020-07-01 12:11:24,752 INFO L711 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2020-07-01 12:11:24,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:11:24,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:11:24,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:11:24,756 INFO L87 Difference]: Start difference. First operand 5 states and 7 transitions. Second operand 4 states. [2020-07-01 12:11:24,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:11:24,778 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-07-01 12:11:24,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:11:24,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2020-07-01 12:11:24,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 12:11:24,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 7 states and 9 transitions. [2020-07-01 12:11:24,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-07-01 12:11:24,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-07-01 12:11:24,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2020-07-01 12:11:24,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 12:11:24,782 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-01 12:11:24,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2020-07-01 12:11:24,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2020-07-01 12:11:24,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-01 12:11:24,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2020-07-01 12:11:24,783 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2020-07-01 12:11:24,784 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2020-07-01 12:11:24,784 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-01 12:11:24,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2020-07-01 12:11:24,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 12:11:24,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:11:24,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:11:24,785 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2020-07-01 12:11:24,785 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 12:11:24,785 INFO L794 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~c~0] 112#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 109#L15 [34] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 110#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 107#L15 [2020-07-01 12:11:24,785 INFO L796 eck$LassoCheckResult]: Loop: 107#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 108#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 107#L15 [2020-07-01 12:11:24,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:24,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1728963, now seen corresponding path program 2 times [2020-07-01 12:11:24,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:11:24,786 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772844441] [2020-07-01 12:11:24,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:11:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:24,797 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:11:24,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:24,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1736, now seen corresponding path program 1 times [2020-07-01 12:11:24,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:11:24,798 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681981517] [2020-07-01 12:11:24,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:11:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:24,806 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:11:24,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:24,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1661534218, now seen corresponding path program 2 times [2020-07-01 12:11:24,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:11:24,807 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597972823] [2020-07-01 12:11:24,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:11:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:24,821 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:11:24,842 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 12:11:24,843 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 12:11:24,843 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 12:11:24,843 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 12:11:24,843 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 12:11:24,843 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:24,843 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 12:11:24,843 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 12:11:24,843 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-07-01 12:11:24,844 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 12:11:24,844 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 12:11:24,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:24,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:24,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:24,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:24,925 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 12:11:24,925 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:24,934 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 12:11:24,934 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 12:11:24,939 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 12:11:24,939 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:24,972 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 12:11:24,973 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:25,010 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 12:11:25,010 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 12:11:25,088 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 12:11:25,090 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 12:11:25,090 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 12:11:25,090 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 12:11:25,090 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 12:11:25,090 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 12:11:25,090 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:25,091 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 12:11:25,091 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 12:11:25,091 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-07-01 12:11:25,091 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 12:11:25,091 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 12:11:25,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:25,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:25,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:25,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:25,163 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 12:11:25,163 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:25,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:11:25,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:11:25,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:11:25,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:11:25,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:11:25,174 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:11:25,174 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:11:25,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:25,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:11:25,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:11:25,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:11:25,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:11:25,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:11:25,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:11:25,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:11:25,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:11:25,221 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 12:11:25,225 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 12:11:25,225 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:25,228 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 12:11:25,228 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 12:11:25,228 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 12:11:25,228 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2020-07-01 12:11:25,258 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 12:11:25,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:25,278 INFO L264 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 12:11:25,278 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:25,283 WARN L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:11:25,283 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:25,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:11:25,306 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-07-01 12:11:25,306 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-01 12:11:25,307 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 6 states and 8 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-07-01 12:11:25,324 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 6 states and 8 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 10 states and 14 transitions. Complement of second has 4 states. [2020-07-01 12:11:25,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-01 12:11:25,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-01 12:11:25,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-07-01 12:11:25,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-01 12:11:25,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:11:25,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-01 12:11:25,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:11:25,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-01 12:11:25,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:11:25,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 14 transitions. [2020-07-01 12:11:25,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-01 12:11:25,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 9 states and 12 transitions. [2020-07-01 12:11:25,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-07-01 12:11:25,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-07-01 12:11:25,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2020-07-01 12:11:25,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 12:11:25,329 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-07-01 12:11:25,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2020-07-01 12:11:25,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2020-07-01 12:11:25,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-01 12:11:25,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2020-07-01 12:11:25,331 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-01 12:11:25,331 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-01 12:11:25,331 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-01 12:11:25,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2020-07-01 12:11:25,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-01 12:11:25,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:11:25,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:11:25,332 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2020-07-01 12:11:25,332 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-07-01 12:11:25,332 INFO L794 eck$LassoCheckResult]: Stem: 165#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~c~0] 166#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 163#L15 [34] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 164#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 161#L15 [2020-07-01 12:11:25,332 INFO L796 eck$LassoCheckResult]: Loop: 161#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 162#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 163#L15 [34] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 164#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 161#L15 [2020-07-01 12:11:25,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:25,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1728963, now seen corresponding path program 3 times [2020-07-01 12:11:25,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:11:25,333 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883018659] [2020-07-01 12:11:25,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:11:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:25,342 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:11:25,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:25,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1669381, now seen corresponding path program 1 times [2020-07-01 12:11:25,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:11:25,343 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297860699] [2020-07-01 12:11:25,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:11:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:25,354 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:11:25,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:25,355 INFO L82 PathProgramCache]: Analyzing trace with hash -993449529, now seen corresponding path program 3 times [2020-07-01 12:11:25,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:11:25,355 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205114911] [2020-07-01 12:11:25,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:11:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:25,370 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:11:25,416 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 12:11:25,417 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 12:11:25,417 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 12:11:25,417 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 12:11:25,417 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 12:11:25,417 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:25,417 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 12:11:25,417 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 12:11:25,417 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-07-01 12:11:25,418 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 12:11:25,418 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 12:11:25,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:25,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:25,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:25,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:25,492 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 12:11:25,493 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:25,497 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 12:11:25,497 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 12:11:25,501 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 12:11:25,502 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:25,535 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 12:11:25,535 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 12:11:25,539 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 12:11:25,539 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=2} Honda state: {ULTIMATE.start_main_~c~0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:25,572 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 12:11:25,572 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:25,608 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 12:11:25,608 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 12:11:25,614 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 12:11:25,643 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 12:11:25,643 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 12:11:25,643 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 12:11:25,643 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 12:11:25,644 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 12:11:25,644 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:25,644 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 12:11:25,644 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 12:11:25,644 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-07-01 12:11:25,644 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 12:11:25,644 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 12:11:25,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:25,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:25,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:25,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:25,705 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 12:11:25,705 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:25,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:11:25,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:11:25,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:11:25,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:11:25,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:11:25,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:11:25,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:11:25,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:11:25,716 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:25,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:11:25,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:11:25,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:11:25,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:11:25,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:11:25,754 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:11:25,754 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:11:25,758 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:25,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:11:25,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:11:25,794 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:11:25,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:11:25,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:11:25,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:11:25,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:11:25,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:11:25,798 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 12:11:25,801 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 12:11:25,801 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:25,803 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 12:11:25,804 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 12:11:25,804 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 12:11:25,804 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 221 Supporting invariants [] [2020-07-01 12:11:25,833 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 12:11:25,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:25,850 INFO L264 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 12:11:25,850 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:25,866 INFO L264 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 12:11:25,867 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:25,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:11:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:25,917 INFO L264 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 12:11:25,919 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:25,922 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-07-01 12:11:25,922 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-07-01 12:11:25,922 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2020-07-01 12:11:25,953 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 22 states and 27 transitions. Complement of second has 8 states. [2020-07-01 12:11:25,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-01 12:11:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-01 12:11:25,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-07-01 12:11:25,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-01 12:11:25,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:11:25,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2020-07-01 12:11:25,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:11:25,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 8 letters. [2020-07-01 12:11:25,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:11:25,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2020-07-01 12:11:25,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-01 12:11:25,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 17 states and 22 transitions. [2020-07-01 12:11:25,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-07-01 12:11:25,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-07-01 12:11:25,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2020-07-01 12:11:25,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 12:11:25,959 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-07-01 12:11:25,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2020-07-01 12:11:25,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2020-07-01 12:11:25,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 12:11:25,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-07-01 12:11:25,961 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-07-01 12:11:25,961 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-07-01 12:11:25,961 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-01 12:11:25,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2020-07-01 12:11:25,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 12:11:25,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:11:25,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:11:25,963 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2020-07-01 12:11:25,963 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2020-07-01 12:11:25,963 INFO L794 eck$LassoCheckResult]: Stem: 254#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~c~0] 255#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 256#L15 [34] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 258#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 259#L15 [2020-07-01 12:11:25,963 INFO L796 eck$LassoCheckResult]: Loop: 259#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 262#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 261#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 260#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 256#L15 [34] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 258#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 259#L15 [2020-07-01 12:11:25,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:25,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1728963, now seen corresponding path program 4 times [2020-07-01 12:11:25,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:11:25,964 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226280987] [2020-07-01 12:11:25,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:11:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:25,973 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:11:25,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:25,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1603978316, now seen corresponding path program 2 times [2020-07-01 12:11:25,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:11:25,974 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41781302] [2020-07-01 12:11:25,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:11:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:25,986 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:11:25,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:25,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1222554482, now seen corresponding path program 4 times [2020-07-01 12:11:25,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:11:25,987 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868760977] [2020-07-01 12:11:25,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:11:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:26,020 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 12:11:26,021 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868760977] [2020-07-01 12:11:26,021 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136187203] [2020-07-01 12:11:26,021 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:11:26,044 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-01 12:11:26,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:11:26,044 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 12:11:26,045 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:26,051 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 12:11:26,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:11:26,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-07-01 12:11:26,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469803059] [2020-07-01 12:11:26,105 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 12:11:26,105 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 12:11:26,105 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 12:11:26,106 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 12:11:26,106 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 12:11:26,106 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:26,106 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 12:11:26,106 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 12:11:26,106 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-07-01 12:11:26,106 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 12:11:26,106 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 12:11:26,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:26,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:26,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:26,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:26,166 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 12:11:26,166 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:26,169 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 12:11:26,169 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:26,203 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 12:11:26,203 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 12:11:26,951 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 12:11:26,954 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 12:11:26,954 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 12:11:26,954 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 12:11:26,954 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 12:11:26,954 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 12:11:26,954 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:26,954 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 12:11:26,955 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 12:11:26,955 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-07-01 12:11:26,955 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 12:11:26,955 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 12:11:26,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:26,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:26,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:26,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:27,016 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 12:11:27,017 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:27,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:11:27,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:11:27,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:11:27,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:11:27,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:11:27,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:11:27,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:11:27,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:11:27,026 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 12:11:27,028 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-01 12:11:27,028 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:27,031 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 12:11:27,032 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 12:11:27,032 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 12:11:27,032 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2020-07-01 12:11:27,061 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 12:11:27,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:27,077 INFO L264 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 12:11:27,078 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:27,084 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 12:11:27,085 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:27,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:11:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:27,147 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 12:11:27,148 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:27,170 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 12:11:27,171 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:27,174 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-07-01 12:11:27,174 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2020-07-01 12:11:27,175 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 19 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-07-01 12:11:27,215 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 19 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 63 states and 78 transitions. Complement of second has 14 states. [2020-07-01 12:11:27,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-01 12:11:27,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-01 12:11:27,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2020-07-01 12:11:27,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2020-07-01 12:11:27,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:11:27,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2020-07-01 12:11:27,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:11:27,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 4 letters. Loop has 12 letters. [2020-07-01 12:11:27,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:11:27,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 78 transitions. [2020-07-01 12:11:27,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-07-01 12:11:27,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 37 states and 50 transitions. [2020-07-01 12:11:27,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-07-01 12:11:27,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-01 12:11:27,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2020-07-01 12:11:27,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 12:11:27,225 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2020-07-01 12:11:27,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2020-07-01 12:11:27,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2020-07-01 12:11:27,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:11:27,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2020-07-01 12:11:27,229 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-07-01 12:11:27,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:11:27,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:11:27,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:11:27,229 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 5 states. [2020-07-01 12:11:27,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:11:27,246 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2020-07-01 12:11:27,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:11:27,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 68 transitions. [2020-07-01 12:11:27,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-07-01 12:11:27,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 37 states and 51 transitions. [2020-07-01 12:11:27,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-01 12:11:27,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-01 12:11:27,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 51 transitions. [2020-07-01 12:11:27,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 12:11:27,250 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-07-01 12:11:27,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 51 transitions. [2020-07-01 12:11:27,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2020-07-01 12:11:27,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 12:11:27,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2020-07-01 12:11:27,253 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2020-07-01 12:11:27,254 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2020-07-01 12:11:27,254 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-01 12:11:27,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 46 transitions. [2020-07-01 12:11:27,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-07-01 12:11:27,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:11:27,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:11:27,255 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2020-07-01 12:11:27,255 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2] [2020-07-01 12:11:27,256 INFO L794 eck$LassoCheckResult]: Stem: 540#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~c~0] 541#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 556#L15 [34] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 557#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 545#L15 [34] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 542#L15-2 [2020-07-01 12:11:27,256 INFO L796 eck$LassoCheckResult]: Loop: 542#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 543#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 561#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 560#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 558#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 549#L15 [34] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 546#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 545#L15 [34] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 542#L15-2 [2020-07-01 12:11:27,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:27,256 INFO L82 PathProgramCache]: Analyzing trace with hash 53597887, now seen corresponding path program 5 times [2020-07-01 12:11:27,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:11:27,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203110972] [2020-07-01 12:11:27,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:11:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:27,267 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:11:27,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:27,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1415935609, now seen corresponding path program 3 times [2020-07-01 12:11:27,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:11:27,267 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458843041] [2020-07-01 12:11:27,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:11:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:27,295 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 12:11:27,295 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458843041] [2020-07-01 12:11:27,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:11:27,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:11:27,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397264688] [2020-07-01 12:11:27,296 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 12:11:27,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:11:27,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:11:27,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:11:27,297 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. cyclomatic complexity: 14 Second operand 4 states. [2020-07-01 12:11:27,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:11:27,312 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2020-07-01 12:11:27,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:11:27,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2020-07-01 12:11:27,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-07-01 12:11:27,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 32 states and 40 transitions. [2020-07-01 12:11:27,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-01 12:11:27,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-01 12:11:27,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2020-07-01 12:11:27,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 12:11:27,316 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 40 transitions. [2020-07-01 12:11:27,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2020-07-01 12:11:27,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2020-07-01 12:11:27,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 12:11:27,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2020-07-01 12:11:27,320 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2020-07-01 12:11:27,320 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2020-07-01 12:11:27,320 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-01 12:11:27,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 37 transitions. [2020-07-01 12:11:27,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-07-01 12:11:27,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:11:27,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:11:27,322 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2020-07-01 12:11:27,322 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [10, 6, 4] [2020-07-01 12:11:27,322 INFO L794 eck$LassoCheckResult]: Stem: 621#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~c~0] 622#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 641#L15 [34] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 631#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 626#L15 [34] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 623#L15-2 [2020-07-01 12:11:27,323 INFO L796 eck$LassoCheckResult]: Loop: 623#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 617#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 618#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 645#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 644#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 643#L15 [34] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 642#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 640#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 639#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 636#L15 [34] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 638#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 637#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 635#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 634#L15 [34] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 633#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 632#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 630#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 628#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 629#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 625#L15 [34] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 623#L15-2 [2020-07-01 12:11:27,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:27,323 INFO L82 PathProgramCache]: Analyzing trace with hash 53597887, now seen corresponding path program 6 times [2020-07-01 12:11:27,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:11:27,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082609197] [2020-07-01 12:11:27,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:11:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:27,333 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:11:27,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:27,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1241163421, now seen corresponding path program 4 times [2020-07-01 12:11:27,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:11:27,334 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687601386] [2020-07-01 12:11:27,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:11:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:27,362 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:11:27,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:27,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1836475681, now seen corresponding path program 5 times [2020-07-01 12:11:27,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:11:27,363 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570154512] [2020-07-01 12:11:27,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:11:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:27,490 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 49 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:11:27,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570154512] [2020-07-01 12:11:27,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708010485] [2020-07-01 12:11:27,491 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:11:27,527 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2020-07-01 12:11:27,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:11:27,529 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 12:11:27,530 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:27,640 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 94 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 12:11:27,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:11:27,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2020-07-01 12:11:27,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095702089] [2020-07-01 12:11:27,847 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2020-07-01 12:11:27,862 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 12:11:27,862 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 12:11:27,862 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 12:11:27,862 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 12:11:27,862 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 12:11:27,862 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:27,863 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 12:11:27,863 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 12:11:27,863 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2020-07-01 12:11:27,863 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 12:11:27,863 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 12:11:27,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:27,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:27,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:27,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:27,923 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 12:11:27,923 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:27,927 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 12:11:27,927 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 12:11:27,931 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 12:11:27,931 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:27,964 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 12:11:27,964 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 12:11:27,968 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 12:11:27,968 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:28,000 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 12:11:28,000 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:28,036 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 12:11:28,036 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 12:11:28,110 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 12:11:28,112 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 12:11:28,112 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 12:11:28,112 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 12:11:28,112 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 12:11:28,112 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 12:11:28,112 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:28,112 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 12:11:28,113 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 12:11:28,113 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2020-07-01 12:11:28,113 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 12:11:28,113 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 12:11:28,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:28,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:28,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:28,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:28,171 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 12:11:28,171 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:28,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:11:28,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:11:28,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:11:28,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:11:28,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:11:28,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:11:28,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:11:28,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:11:28,180 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 12:11:28,183 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 12:11:28,183 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:28,187 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 12:11:28,187 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 12:11:28,187 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 12:11:28,187 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2020-07-01 12:11:28,217 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 12:11:28,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:28,233 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 12:11:28,233 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:28,247 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-01 12:11:28,248 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:28,291 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 54 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-01 12:11:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:28,310 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-01 12:11:28,311 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:28,379 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-01 12:11:28,380 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:28,424 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 12:11:28,425 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:28,525 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 12:11:28,526 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:28,545 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 12:11:28,546 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:28,575 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 12:11:28,576 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:28,593 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 12:11:28,594 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:28,614 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 12:11:28,615 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:28,635 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 12:11:28,637 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:28,664 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 12:11:28,665 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:28,684 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 12:11:28,685 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:28,708 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 12:11:28,709 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:28,732 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-01 12:11:28,733 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:28,817 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-01 12:11:28,818 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:28,837 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-01 12:11:28,838 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:28,866 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-01 12:11:28,866 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:28,891 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 12:11:28,891 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:28,908 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-01 12:11:28,909 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:28,915 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 20 predicates after loop cannibalization [2020-07-01 12:11:28,915 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 20 loop predicates [2020-07-01 12:11:28,915 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 29 states and 37 transitions. cyclomatic complexity: 10 Second operand 7 states. [2020-07-01 12:11:29,684 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 29 states and 37 transitions. cyclomatic complexity: 10. Second operand 7 states. Result 506 states and 572 transitions. Complement of second has 170 states. [2020-07-01 12:11:29,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 1 stem states 17 non-accepting loop states 3 accepting loop states [2020-07-01 12:11:29,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-01 12:11:29,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 41 transitions. [2020-07-01 12:11:29,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 41 transitions. Stem has 5 letters. Loop has 20 letters. [2020-07-01 12:11:29,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:11:29,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 41 transitions. Stem has 25 letters. Loop has 20 letters. [2020-07-01 12:11:29,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:11:29,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 41 transitions. Stem has 5 letters. Loop has 40 letters. [2020-07-01 12:11:29,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:11:29,699 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 506 states and 572 transitions. [2020-07-01 12:11:29,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2020-07-01 12:11:29,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 506 states to 46 states and 52 transitions. [2020-07-01 12:11:29,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-01 12:11:29,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-07-01 12:11:29,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 52 transitions. [2020-07-01 12:11:29,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 12:11:29,710 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 52 transitions. [2020-07-01 12:11:29,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 52 transitions. [2020-07-01 12:11:29,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 25. [2020-07-01 12:11:29,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 12:11:29,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2020-07-01 12:11:29,724 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-07-01 12:11:29,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:11:29,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-01 12:11:29,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2020-07-01 12:11:29,725 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 23 states. [2020-07-01 12:11:29,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:11:29,974 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2020-07-01 12:11:29,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-01 12:11:29,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 76 transitions. [2020-07-01 12:11:29,977 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 48 [2020-07-01 12:11:29,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 76 transitions. [2020-07-01 12:11:29,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-07-01 12:11:29,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-07-01 12:11:29,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 76 transitions. [2020-07-01 12:11:29,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 12:11:29,979 INFO L688 BuchiCegarLoop]: Abstraction has 66 states and 76 transitions. [2020-07-01 12:11:29,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 76 transitions. [2020-07-01 12:11:29,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 25. [2020-07-01 12:11:29,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 12:11:29,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2020-07-01 12:11:29,982 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-07-01 12:11:29,982 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-07-01 12:11:29,982 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-01 12:11:29,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. [2020-07-01 12:11:29,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2020-07-01 12:11:29,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:11:29,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:11:29,983 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2020-07-01 12:11:29,983 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 5, 4] [2020-07-01 12:11:29,984 INFO L794 eck$LassoCheckResult]: Stem: 2717#ULTIMATE.startENTRY [26] ULTIMATE.startENTRY-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_1 1) (= v_ULTIMATE.start_main_~n~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_1, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~c~0] 2718#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2729#L15 [34] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2728#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2724#L15 [34] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2723#L15-2 [2020-07-01 12:11:29,984 INFO L796 eck$LassoCheckResult]: Loop: 2723#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2726#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2727#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2732#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2730#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2731#L15 [34] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2719#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2720#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2737#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2735#L15 [34] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2736#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2715#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2716#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2721#L15 [34] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2734#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2733#L15 [24] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~n~0_6 (+ v_ULTIMATE.start_main_~n~0_7 (- 10))) (< 100 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~c~0_8 (+ v_ULTIMATE.start_main_~c~0_9 (- 1)))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_9, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_8, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2714#L15-2 [31] L15-2-->L15: Formula: (< 0 v_ULTIMATE.start_main_~c~0_7) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_7} AuxVars[] AssignedVars[] 2722#L15 [34] L15-->L15-2: Formula: (and (= v_ULTIMATE.start_main_~c~0_10 (+ v_ULTIMATE.start_main_~c~0_11 1)) (>= 100 v_ULTIMATE.start_main_~n~0_9) (= v_ULTIMATE.start_main_~n~0_8 (+ v_ULTIMATE.start_main_~n~0_9 11))) InVars {ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_11, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9} OutVars{ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_10, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0] 2723#L15-2 [2020-07-01 12:11:29,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:29,985 INFO L82 PathProgramCache]: Analyzing trace with hash 53597887, now seen corresponding path program 7 times [2020-07-01 12:11:29,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:11:29,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128850273] [2020-07-01 12:11:29,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:11:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:29,994 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:11:29,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:29,994 INFO L82 PathProgramCache]: Analyzing trace with hash -631458422, now seen corresponding path program 5 times [2020-07-01 12:11:29,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:11:29,995 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307654819] [2020-07-01 12:11:29,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:11:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:30,012 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:11:30,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:30,013 INFO L82 PathProgramCache]: Analyzing trace with hash -445015864, now seen corresponding path program 6 times [2020-07-01 12:11:30,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:11:30,013 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107341249] [2020-07-01 12:11:30,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:11:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:11:30,038 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:11:30,182 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2020-07-01 12:11:30,196 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 12:11:30,196 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 12:11:30,196 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 12:11:30,196 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 12:11:30,196 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 12:11:30,197 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:30,197 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 12:11:30,197 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 12:11:30,197 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop [2020-07-01 12:11:30,197 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 12:11:30,197 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 12:11:30,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:30,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:30,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:30,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:30,254 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 12:11:30,254 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:30,258 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 12:11:30,258 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:11:30,294 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 12:11:30,294 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 12:11:30,329 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 12:11:30,331 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 12:11:30,331 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 12:11:30,331 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 12:11:30,331 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 12:11:30,331 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 12:11:30,331 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:30,331 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 12:11:30,332 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 12:11:30,332 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop [2020-07-01 12:11:30,332 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 12:11:30,332 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 12:11:30,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:30,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:30,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:30,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:11:30,389 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 12:11:30,390 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:30,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:11:30,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:11:30,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:11:30,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:11:30,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:11:30,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:11:30,397 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:11:30,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:11:30,400 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 12:11:30,403 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 12:11:30,403 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:11:30,406 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 12:11:30,407 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 12:11:30,407 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 12:11:30,407 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2020-07-01 12:11:30,436 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 12:11:30,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:11:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:30,452 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 12:11:30,453 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:30,462 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 12:11:30,463 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:30,506 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-01 12:11:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:30,529 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 12:11:30,530 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:30,614 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 12:11:30,615 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:30,656 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 12:11:30,656 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:30,753 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 12:11:30,753 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:30,782 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 12:11:30,783 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:30,819 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 12:11:30,819 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:30,854 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 12:11:30,855 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:30,891 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 12:11:30,892 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:30,938 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 12:11:30,939 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:30,960 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 12:11:30,961 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:30,982 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 12:11:30,983 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:31,017 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 12:11:31,017 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:31,050 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 12:11:31,051 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:31,068 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 12:11:31,069 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:31,086 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 12:11:31,087 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:11:31,122 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-01 12:11:31,123 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:11:31,149 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-07-01 12:11:31,149 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2020-07-01 12:11:31,149 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 25 states and 28 transitions. cyclomatic complexity: 5 Second operand 8 states. [2020-07-01 12:11:31,252 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 25 states and 28 transitions. cyclomatic complexity: 5. Second operand 8 states. Result 175 states and 206 transitions. Complement of second has 34 states. [2020-07-01 12:11:31,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2020-07-01 12:11:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-01 12:11:31,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2020-07-01 12:11:31,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 5 letters. Loop has 18 letters. [2020-07-01 12:11:31,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:11:31,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 23 letters. Loop has 18 letters. [2020-07-01 12:11:31,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:11:31,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 5 letters. Loop has 36 letters. [2020-07-01 12:11:31,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:11:31,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 206 transitions. [2020-07-01 12:11:31,258 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 12:11:31,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 0 states and 0 transitions. [2020-07-01 12:11:31,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-01 12:11:31,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-01 12:11:31,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-01 12:11:31,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 12:11:31,258 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:11:31,259 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:11:31,259 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:11:31,259 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-01 12:11:31,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:11:31,259 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 12:11:31,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-01 12:11:31,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:11:31 BasicIcfg [2020-07-01 12:11:31,266 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-01 12:11:31,267 INFO L168 Benchmark]: Toolchain (without parser) took 9020.72 ms. Allocated memory was 514.9 MB in the beginning and 677.4 MB in the end (delta: 162.5 MB). Free memory was 435.8 MB in the beginning and 556.8 MB in the end (delta: -121.0 MB). Peak memory consumption was 41.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:11:31,267 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 455.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:11:31,268 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.99 ms. Allocated memory was 514.9 MB in the beginning and 561.5 MB in the end (delta: 46.7 MB). Free memory was 435.8 MB in the beginning and 531.1 MB in the end (delta: -95.3 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:11:31,268 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.07 ms. Allocated memory is still 561.5 MB. Free memory was 531.1 MB in the beginning and 529.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:11:31,269 INFO L168 Benchmark]: Boogie Preprocessor took 20.04 ms. Allocated memory is still 561.5 MB. Free memory was 529.4 MB in the beginning and 528.6 MB in the end (delta: 822.4 kB). Peak memory consumption was 822.4 kB. Max. memory is 50.3 GB. [2020-07-01 12:11:31,270 INFO L168 Benchmark]: RCFGBuilder took 228.76 ms. Allocated memory is still 561.5 MB. Free memory was 527.8 MB in the beginning and 517.5 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:11:31,270 INFO L168 Benchmark]: BlockEncodingV2 took 75.39 ms. Allocated memory is still 561.5 MB. Free memory was 516.6 MB in the beginning and 512.5 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:11:31,270 INFO L168 Benchmark]: TraceAbstraction took 145.92 ms. Allocated memory is still 561.5 MB. Free memory was 511.7 MB in the beginning and 503.3 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:11:31,271 INFO L168 Benchmark]: BuchiAutomizer took 8215.65 ms. Allocated memory was 561.5 MB in the beginning and 677.4 MB in the end (delta: 115.9 MB). Free memory was 503.3 MB in the beginning and 556.8 MB in the end (delta: -53.4 MB). Peak memory consumption was 62.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:11:31,274 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 7 locations, 9 edges - StatisticsResult: Encoded RCFG 3 locations, 4 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 455.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 293.99 ms. Allocated memory was 514.9 MB in the beginning and 561.5 MB in the end (delta: 46.7 MB). Free memory was 435.8 MB in the beginning and 531.1 MB in the end (delta: -95.3 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 35.07 ms. Allocated memory is still 561.5 MB. Free memory was 531.1 MB in the beginning and 529.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 20.04 ms. Allocated memory is still 561.5 MB. Free memory was 529.4 MB in the beginning and 528.6 MB in the end (delta: 822.4 kB). Peak memory consumption was 822.4 kB. Max. memory is 50.3 GB. * RCFGBuilder took 228.76 ms. Allocated memory is still 561.5 MB. Free memory was 527.8 MB in the beginning and 517.5 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 75.39 ms. Allocated memory is still 561.5 MB. Free memory was 516.6 MB in the beginning and 512.5 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 50.3 GB. * TraceAbstraction took 145.92 ms. Allocated memory is still 561.5 MB. Free memory was 511.7 MB in the beginning and 503.3 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 8215.65 ms. Allocated memory was 561.5 MB in the beginning and 677.4 MB in the end (delta: 115.9 MB). Free memory was 503.3 MB in the beginning and 556.8 MB in the end (delta: -53.4 MB). Peak memory consumption was 62.4 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 3 locations, 0 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (4 trivial, 0 deterministic, 7 nondeterministic). One nondeterministic module has affine ranking function -2 * n + 211 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * n + 211 and consists of 3 locations. One nondeterministic module has affine ranking function c and consists of 3 locations. One nondeterministic module has affine ranking function -2 * n + 221 and consists of 4 locations. One nondeterministic module has affine ranking function n and consists of 5 locations. One nondeterministic module has affine ranking function c and consists of 22 locations. One nondeterministic module has affine ranking function c and consists of 7 locations. 4 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.1s and 9 iterations. TraceHistogramMax:10. Analysis of lassos took 4.8s. Construction of modules took 0.2s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 88 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 5. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 140/170 HoareTripleCheckerStatistics: 36 SDtfs, 63 SDslu, 27 SDs, 0 SdLazy, 320 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT4 conc0 concLT3 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax162 hnf100 lsp37 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf94 smp100 dnf100 smp100 tf112 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-07-01 12:11:18.954 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_xUusCT/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:11:31.907 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check