./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 77af8780d2ec99ad0d03b475aa25db67a7ba0a218594f51cddbe35460cd2b670 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-25 00:47:28,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-25 00:47:29,016 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-25 00:47:29,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-25 00:47:29,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-25 00:47:29,049 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-25 00:47:29,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-25 00:47:29,049 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-25 00:47:29,050 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-25 00:47:29,050 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-25 00:47:29,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-25 00:47:29,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-25 00:47:29,052 INFO L153 SettingsManager]: * Use SBE=true [2024-10-25 00:47:29,053 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-25 00:47:29,053 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-25 00:47:29,054 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-25 00:47:29,054 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-25 00:47:29,054 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-25 00:47:29,057 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-25 00:47:29,057 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-25 00:47:29,057 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-25 00:47:29,058 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-25 00:47:29,058 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-25 00:47:29,058 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-25 00:47:29,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-25 00:47:29,059 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-25 00:47:29,059 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-25 00:47:29,059 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-25 00:47:29,059 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-25 00:47:29,059 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-25 00:47:29,059 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-25 00:47:29,060 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-25 00:47:29,060 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-25 00:47:29,060 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-25 00:47:29,060 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-25 00:47:29,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-25 00:47:29,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-25 00:47:29,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-25 00:47:29,061 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-25 00:47:29,061 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77af8780d2ec99ad0d03b475aa25db67a7ba0a218594f51cddbe35460cd2b670 [2024-10-25 00:47:29,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-25 00:47:29,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-25 00:47:29,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-25 00:47:29,323 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-25 00:47:29,323 INFO L274 PluginConnector]: CDTParser initialized [2024-10-25 00:47:29,324 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c [2024-10-25 00:47:30,568 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-25 00:47:30,785 INFO L384 CDTParser]: Found 1 translation units. [2024-10-25 00:47:30,785 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c [2024-10-25 00:47:30,798 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3882ebd6e/0b108b57ebeb444a885ebe061a7ff2be/FLAG36cf3274b [2024-10-25 00:47:30,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3882ebd6e/0b108b57ebeb444a885ebe061a7ff2be [2024-10-25 00:47:30,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-25 00:47:30,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-25 00:47:30,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-25 00:47:30,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-25 00:47:30,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-25 00:47:30,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:47:30" (1/1) ... [2024-10-25 00:47:30,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51dce95d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:47:30, skipping insertion in model container [2024-10-25 00:47:30,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:47:30" (1/1) ... [2024-10-25 00:47:30,856 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-25 00:47:31,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:47:31,135 INFO L200 MainTranslator]: Completed pre-run [2024-10-25 00:47:31,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:47:31,238 INFO L204 MainTranslator]: Completed translation [2024-10-25 00:47:31,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:47:31 WrapperNode [2024-10-25 00:47:31,239 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-25 00:47:31,240 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-25 00:47:31,240 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-25 00:47:31,240 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-25 00:47:31,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:47:31" (1/1) ... [2024-10-25 00:47:31,258 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:47:31" (1/1) ... [2024-10-25 00:47:31,304 INFO L138 Inliner]: procedures = 23, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 973 [2024-10-25 00:47:31,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-25 00:47:31,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-25 00:47:31,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-25 00:47:31,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-25 00:47:31,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:47:31" (1/1) ... [2024-10-25 00:47:31,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:47:31" (1/1) ... [2024-10-25 00:47:31,323 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:47:31" (1/1) ... [2024-10-25 00:47:31,344 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-25 00:47:31,345 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:47:31" (1/1) ... [2024-10-25 00:47:31,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:47:31" (1/1) ... [2024-10-25 00:47:31,361 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:47:31" (1/1) ... [2024-10-25 00:47:31,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:47:31" (1/1) ... [2024-10-25 00:47:31,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:47:31" (1/1) ... [2024-10-25 00:47:31,387 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:47:31" (1/1) ... [2024-10-25 00:47:31,401 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-25 00:47:31,402 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-25 00:47:31,402 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-25 00:47:31,402 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-25 00:47:31,403 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:47:31" (1/1) ... [2024-10-25 00:47:31,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:47:31,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:47:31,443 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:47:31,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-25 00:47:31,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-25 00:47:31,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-25 00:47:31,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-25 00:47:31,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-25 00:47:31,634 INFO L238 CfgBuilder]: Building ICFG [2024-10-25 00:47:31,637 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-25 00:47:32,429 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2024-10-25 00:47:32,429 INFO L287 CfgBuilder]: Performing block encoding [2024-10-25 00:47:32,450 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-25 00:47:32,450 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-25 00:47:32,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:47:32 BoogieIcfgContainer [2024-10-25 00:47:32,451 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-25 00:47:32,451 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-25 00:47:32,453 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-25 00:47:32,456 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-25 00:47:32,457 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:47:32,457 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.10 12:47:30" (1/3) ... [2024-10-25 00:47:32,458 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72d64c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:47:32, skipping insertion in model container [2024-10-25 00:47:32,458 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:47:32,458 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:47:31" (2/3) ... [2024-10-25 00:47:32,458 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72d64c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:47:32, skipping insertion in model container [2024-10-25 00:47:32,458 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:47:32,458 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:47:32" (3/3) ... [2024-10-25 00:47:32,459 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c [2024-10-25 00:47:32,501 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-25 00:47:32,501 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-25 00:47:32,501 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-25 00:47:32,501 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-25 00:47:32,502 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-25 00:47:32,502 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-25 00:47:32,502 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-25 00:47:32,502 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-25 00:47:32,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 288 states, 287 states have (on average 1.818815331010453) internal successors, (522), 287 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:47:32,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 100 [2024-10-25 00:47:32,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:47:32,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:47:32,542 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:47:32,542 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:47:32,543 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-25 00:47:32,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 288 states, 287 states have (on average 1.818815331010453) internal successors, (522), 287 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:47:32,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 100 [2024-10-25 00:47:32,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:47:32,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:47:32,564 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:47:32,566 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:47:32,577 INFO L745 eck$LassoCheckResult]: Stem: 179#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; 191#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1, main_#t~post50#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep14~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep21~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep23~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep24~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;assume 0 == main_#t~nondet10#1 || 1 == main_#t~nondet10#1;~ep31~0 := (if 0 == main_#t~nondet10#1 % 256 then 0 else 1);havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;assume 0 == main_#t~nondet11#1 || 1 == main_#t~nondet11#1;~ep32~0 := (if 0 == main_#t~nondet11#1 % 256 then 0 else 1);havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume 0 == main_#t~nondet12#1 || 1 == main_#t~nondet12#1;~ep34~0 := (if 0 == main_#t~nondet12#1 % 256 then 0 else 1);havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;assume 0 == main_#t~nondet13#1 || 1 == main_#t~nondet13#1;~ep41~0 := (if 0 == main_#t~nondet13#1 % 256 then 0 else 1);havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;assume 0 == main_#t~nondet14#1 || 1 == main_#t~nondet14#1;~ep42~0 := (if 0 == main_#t~nondet14#1 % 256 then 0 else 1);havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;assume 0 == main_#t~nondet15#1 || 1 == main_#t~nondet15#1;~ep43~0 := (if 0 == main_#t~nondet15#1 % 256 then 0 else 1);havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;assume 0 == main_#t~nondet22#1 || 1 == main_#t~nondet22#1;~mode1~0 := (if 0 == main_#t~nondet22#1 % 256 then 0 else 1);havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~newmax1~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~mode2~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~newmax2~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~mode3~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~newmax3~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~id4~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~r4~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~st4~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~nl4~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~m4~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~max4~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~mode4~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~newmax4~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r141~0#1 := (if 0 == ~ep14~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r241~0#1 := (if 0 == ~ep24~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1);init_~r341~0#1 := (if 0 == ~ep34~0 % 256 then 0 else 1);init_~r411~0#1 := (if 0 == ~ep41~0 % 256 then 0 else 1);init_~r421~0#1 := (if 0 == ~ep42~0 % 256 then 0 else 1);init_~r431~0#1 := (if 0 == ~ep43~0 % 256 then 0 else 1); 30#L441true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 228#L452true init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 102#L462true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 135#L473true init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 258#L483true assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 232#L494true init_~r142~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 233#L504true assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 54#L515true init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 2#L525true assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 222#L536true init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 49#L546true assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 286#L557true init_~r242~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 65#L567true assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 198#L578true init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___5~0#1 then 0 else 1) % 256 then 0 else 1); 110#L588true assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 215#L599true init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___6~0#1 then 0 else 1) % 256 then 0 else 1); 99#L609true assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 74#L620true init_~r342~0#1 := (if 0 == (if 0 == init_~tmp___7~0#1 then 0 else 1) % 256 then 0 else 1); 104#L630true assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 194#L641true init_~r412~0#1 := (if 0 == (if 0 == init_~tmp___8~0#1 then 0 else 1) % 256 then 0 else 1); 271#L651true assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 200#L662true init_~r422~0#1 := (if 0 == (if 0 == init_~tmp___9~0#1 then 0 else 1) % 256 then 0 else 1); 130#L672true assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 235#L683true init_~r432~0#1 := (if 0 == (if 0 == init_~tmp___10~0#1 then 0 else 1) % 256 then 0 else 1); 274#L693true assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 211#L704true init_~r123~0#1 := (if 0 == (if 0 == init_~tmp___11~0#1 then 0 else 1) % 256 then 0 else 1); 156#L714true assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 13#L725true init_~r133~0#1 := (if 0 == (if 0 == init_~tmp___12~0#1 then 0 else 1) % 256 then 0 else 1); 280#L735true assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 109#L746true init_~r143~0#1 := (if 0 == (if 0 == init_~tmp___13~0#1 then 0 else 1) % 256 then 0 else 1); 96#L756true assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 263#L767true init_~r213~0#1 := (if 0 == (if 0 == init_~tmp___14~0#1 then 0 else 1) % 256 then 0 else 1); 32#L777true assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 142#L788true init_~r233~0#1 := (if 0 == (if 0 == init_~tmp___15~0#1 then 0 else 1) % 256 then 0 else 1); 197#L798true assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 276#L809true init_~r243~0#1 := (if 0 == (if 0 == init_~tmp___16~0#1 then 0 else 1) % 256 then 0 else 1); 201#L819true assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 259#L830true init_~r313~0#1 := (if 0 == (if 0 == init_~tmp___17~0#1 then 0 else 1) % 256 then 0 else 1); 126#L840true assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 237#L851true init_~r323~0#1 := (if 0 == (if 0 == init_~tmp___18~0#1 then 0 else 1) % 256 then 0 else 1); 182#L861true assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 240#L872true init_~r343~0#1 := (if 0 == (if 0 == init_~tmp___19~0#1 then 0 else 1) % 256 then 0 else 1); 190#L882true assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 100#L893true init_~r413~0#1 := (if 0 == (if 0 == init_~tmp___20~0#1 then 0 else 1) % 256 then 0 else 1); 255#L903true assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 98#L914true init_~r423~0#1 := (if 0 == (if 0 == init_~tmp___21~0#1 then 0 else 1) % 256 then 0 else 1); 245#L924true assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 90#L935true init_~r433~0#1 := (if 0 == (if 0 == init_~tmp___22~0#1 then 0 else 1) % 256 then 0 else 1); 122#L945true assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 203#L945-1true init_#res#1 := init_~tmp___23~0#1; 114#init_returnLabel#1true main_#t~ret48#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 117#L21true assume !(0 == assume_abort_if_not_~cond#1); 166#L20true havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 20#L1223-2true [2024-10-25 00:47:32,578 INFO L747 eck$LassoCheckResult]: Loop: 20#L1223-2true assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 71#L114true assume !(0 != ~mode1~0 % 256); 251#L150true assume !(~r1~0 < 3); 157#L150-1true ~mode1~0 := 1; 55#L114-2true havoc node1_~newmax~0#1;assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 39#L178true assume !(0 != ~mode2~0 % 256); 279#L214true assume !(~r2~0 < 3); 103#L214-1true ~mode2~0 := 1; 158#L178-2true havoc node2_~newmax~1#1;assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 287#L242true assume !(0 != ~mode3~0 % 256); 149#L278true assume !(~r3~0 < 3); 121#L278-1true ~mode3~0 := 1; 208#L242-2true havoc node3_~newmax~2#1;assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0; 138#L306true assume !(0 != ~mode4~0 % 256); 48#L342true assume !(~r4~0 < 3); 16#L342-1true ~mode4~0 := 1; 59#L306-2true havoc node4_~newmax~3#1;assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 37#L1090true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 33#L1090-1true check_#res#1 := check_~tmp~1#1; 168#check_returnLabel#1true main_#t~ret49#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret49#1;havoc main_#t~ret49#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 35#L1266true assume !(0 == assert_~arg#1 % 256); 243#L1261true havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post50#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post50#1;havoc main_#t~post50#1; 20#L1223-2true [2024-10-25 00:47:32,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:47:32,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1995424982, now seen corresponding path program 1 times [2024-10-25 00:47:32,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:47:32,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787228461] [2024-10-25 00:47:32,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:47:32,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:47:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:47:33,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:47:33,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:47:33,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787228461] [2024-10-25 00:47:33,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787228461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:47:33,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:47:33,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-25 00:47:33,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539360040] [2024-10-25 00:47:33,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:47:33,281 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:47:33,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:47:33,282 INFO L85 PathProgramCache]: Analyzing trace with hash -2093601227, now seen corresponding path program 1 times [2024-10-25 00:47:33,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:47:33,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811352968] [2024-10-25 00:47:33,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:47:33,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:47:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:47:33,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:47:33,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:47:33,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811352968] [2024-10-25 00:47:33,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811352968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:47:33,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:47:33,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-25 00:47:33,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713841900] [2024-10-25 00:47:33,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:47:33,412 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:47:33,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:47:33,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 00:47:33,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-25 00:47:33,444 INFO L87 Difference]: Start difference. First operand has 288 states, 287 states have (on average 1.818815331010453) internal successors, (522), 287 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:47:33,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:47:33,529 INFO L93 Difference]: Finished difference Result 290 states and 521 transitions. [2024-10-25 00:47:33,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 290 states and 521 transitions. [2024-10-25 00:47:33,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 98 [2024-10-25 00:47:33,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 290 states to 282 states and 504 transitions. [2024-10-25 00:47:33,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 282 [2024-10-25 00:47:33,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 282 [2024-10-25 00:47:33,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 282 states and 504 transitions. [2024-10-25 00:47:33,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:47:33,554 INFO L218 hiAutomatonCegarLoop]: Abstraction has 282 states and 504 transitions. [2024-10-25 00:47:33,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states and 504 transitions. [2024-10-25 00:47:33,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-10-25 00:47:33,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 282 states have (on average 1.7872340425531914) internal successors, (504), 281 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:47:33,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 504 transitions. [2024-10-25 00:47:33,600 INFO L240 hiAutomatonCegarLoop]: Abstraction has 282 states and 504 transitions. [2024-10-25 00:47:33,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-25 00:47:33,605 INFO L425 stractBuchiCegarLoop]: Abstraction has 282 states and 504 transitions. [2024-10-25 00:47:33,605 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-25 00:47:33,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 282 states and 504 transitions. [2024-10-25 00:47:33,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 98 [2024-10-25 00:47:33,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:47:33,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:47:33,609 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:47:33,609 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:47:33,609 INFO L745 eck$LassoCheckResult]: Stem: 845#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; 846#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1, main_#t~post50#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep14~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep21~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep23~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep24~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;assume 0 == main_#t~nondet10#1 || 1 == main_#t~nondet10#1;~ep31~0 := (if 0 == main_#t~nondet10#1 % 256 then 0 else 1);havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;assume 0 == main_#t~nondet11#1 || 1 == main_#t~nondet11#1;~ep32~0 := (if 0 == main_#t~nondet11#1 % 256 then 0 else 1);havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume 0 == main_#t~nondet12#1 || 1 == main_#t~nondet12#1;~ep34~0 := (if 0 == main_#t~nondet12#1 % 256 then 0 else 1);havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;assume 0 == main_#t~nondet13#1 || 1 == main_#t~nondet13#1;~ep41~0 := (if 0 == main_#t~nondet13#1 % 256 then 0 else 1);havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;assume 0 == main_#t~nondet14#1 || 1 == main_#t~nondet14#1;~ep42~0 := (if 0 == main_#t~nondet14#1 % 256 then 0 else 1);havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;assume 0 == main_#t~nondet15#1 || 1 == main_#t~nondet15#1;~ep43~0 := (if 0 == main_#t~nondet15#1 % 256 then 0 else 1);havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;assume 0 == main_#t~nondet22#1 || 1 == main_#t~nondet22#1;~mode1~0 := (if 0 == main_#t~nondet22#1 % 256 then 0 else 1);havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~newmax1~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~mode2~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~newmax2~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~mode3~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~newmax3~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~id4~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~r4~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~st4~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~nl4~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~m4~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~max4~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~mode4~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~newmax4~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r141~0#1 := (if 0 == ~ep14~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r241~0#1 := (if 0 == ~ep24~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1);init_~r341~0#1 := (if 0 == ~ep34~0 % 256 then 0 else 1);init_~r411~0#1 := (if 0 == ~ep41~0 % 256 then 0 else 1);init_~r421~0#1 := (if 0 == ~ep42~0 % 256 then 0 else 1);init_~r431~0#1 := (if 0 == ~ep43~0 % 256 then 0 else 1); 660#L441 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 661#L452 init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 780#L462 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 744#L473 init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 808#L483 assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 717#L494 init_~r142~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 867#L504 assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 682#L515 init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 592#L525 assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 593#L536 init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 696#L546 assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 697#L557 init_~r242~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 723#L567 assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 639#L578 init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___5~0#1 then 0 else 1) % 256 then 0 else 1); 786#L588 assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 647#L599 init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___6~0#1 then 0 else 1) % 256 then 0 else 1); 777#L609 assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 702#L620 init_~r342~0#1 := (if 0 == (if 0 == init_~tmp___7~0#1 then 0 else 1) % 256 then 0 else 1); 742#L630 assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 712#L641 init_~r412~0#1 := (if 0 == (if 0 == init_~tmp___8~0#1 then 0 else 1) % 256 then 0 else 1); 852#L651 assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 649#L662 init_~r422~0#1 := (if 0 == (if 0 == init_~tmp___9~0#1 then 0 else 1) % 256 then 0 else 1); 804#L672 assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 805#L683 init_~r432~0#1 := (if 0 == (if 0 == init_~tmp___10~0#1 then 0 else 1) % 256 then 0 else 1); 868#L693 assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 730#L704 init_~r123~0#1 := (if 0 == (if 0 == init_~tmp___11~0#1 then 0 else 1) % 256 then 0 else 1); 830#L714 assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 624#L725 init_~r133~0#1 := (if 0 == (if 0 == init_~tmp___12~0#1 then 0 else 1) % 256 then 0 else 1); 625#L735 assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 596#L746 init_~r143~0#1 := (if 0 == (if 0 == init_~tmp___13~0#1 then 0 else 1) % 256 then 0 else 1); 773#L756 assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 617#L767 init_~r213~0#1 := (if 0 == (if 0 == init_~tmp___14~0#1 then 0 else 1) % 256 then 0 else 1); 663#L777 assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 664#L788 init_~r233~0#1 := (if 0 == (if 0 == init_~tmp___15~0#1 then 0 else 1) % 256 then 0 else 1); 818#L798 assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 827#L809 init_~r243~0#1 := (if 0 == (if 0 == init_~tmp___16~0#1 then 0 else 1) % 256 then 0 else 1); 856#L819 assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 620#L830 init_~r313~0#1 := (if 0 == (if 0 == init_~tmp___17~0#1 then 0 else 1) % 256 then 0 else 1); 800#L840 assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 603#L851 init_~r323~0#1 := (if 0 == (if 0 == init_~tmp___18~0#1 then 0 else 1) % 256 then 0 else 1); 848#L861 assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 707#L872 init_~r343~0#1 := (if 0 == (if 0 == init_~tmp___19~0#1 then 0 else 1) % 256 then 0 else 1); 851#L882 assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 687#L893 init_~r413~0#1 := (if 0 == (if 0 == init_~tmp___20~0#1 then 0 else 1) % 256 then 0 else 1); 778#L903 assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 748#L914 init_~r423~0#1 := (if 0 == (if 0 == init_~tmp___21~0#1 then 0 else 1) % 256 then 0 else 1); 776#L924 assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 765#L935 init_~r433~0#1 := (if 0 == (if 0 == init_~tmp___22~0#1 then 0 else 1) % 256 then 0 else 1); 766#L945 assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 609#L945-1 init_#res#1 := init_~tmp___23~0#1; 789#init_returnLabel#1 main_#t~ret48#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 790#L21 assume !(0 == assume_abort_if_not_~cond#1); 794#L20 havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 636#L1223-2 [2024-10-25 00:47:33,610 INFO L747 eck$LassoCheckResult]: Loop: 636#L1223-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 637#L114 assume !(0 != ~mode1~0 % 256); 735#L150 assume !(~r1~0 < 3); 811#L150-1 ~mode1~0 := 1; 705#L114-2 havoc node1_~newmax~0#1;assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 677#L178 assume !(0 != ~mode2~0 % 256); 678#L214 assume !(~r2~0 < 3); 635#L214-1 ~mode2~0 := 1; 782#L178-2 havoc node2_~newmax~1#1;assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 831#L242 assume !(0 != ~mode3~0 % 256); 824#L278 assume !(~r3~0 < 3); 754#L278-1 ~mode3~0 := 1; 793#L242-2 havoc node3_~newmax~2#1;assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0; 812#L306 assume !(0 != ~mode4~0 % 256); 693#L342 assume !(~r4~0 < 3); 626#L342-1 ~mode4~0 := 1; 627#L306-2 havoc node4_~newmax~3#1;assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 675#L1090 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 676#L1091 assume ~st1~0 + ~nl1~0 <= 1; 756#L1092 assume ~st2~0 + ~nl2~0 <= 1; 840#L1093 assume ~st3~0 + ~nl3~0 <= 1; 865#L1094 assume ~st4~0 + ~nl4~0 <= 1; 862#L1095 assume ~r1~0 >= 3; 732#$Ultimate##678 assume ~r1~0 < 3; 631#$Ultimate##682 assume ~r1~0 >= 3; 632#$Ultimate##686 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 666#L1090-1 check_#res#1 := check_~tmp~1#1; 667#check_returnLabel#1 main_#t~ret49#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret49#1;havoc main_#t~ret49#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 670#L1266 assume !(0 == assert_~arg#1 % 256); 671#L1261 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post50#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post50#1;havoc main_#t~post50#1; 636#L1223-2 [2024-10-25 00:47:33,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:47:33,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1995424982, now seen corresponding path program 2 times [2024-10-25 00:47:33,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:47:33,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738012521] [2024-10-25 00:47:33,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:47:33,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:47:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:47:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:47:33,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:47:33,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738012521] [2024-10-25 00:47:33,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738012521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:47:33,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:47:33,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-25 00:47:33,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447395449] [2024-10-25 00:47:33,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:47:33,825 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:47:33,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:47:33,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2016306172, now seen corresponding path program 1 times [2024-10-25 00:47:33,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:47:33,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465979892] [2024-10-25 00:47:33,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:47:33,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:47:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:47:33,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:47:33,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:47:33,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465979892] [2024-10-25 00:47:33,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465979892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:47:33,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:47:33,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 00:47:33,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204980116] [2024-10-25 00:47:33,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:47:33,853 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:47:33,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:47:33,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 00:47:33,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 00:47:33,854 INFO L87 Difference]: Start difference. First operand 282 states and 504 transitions. cyclomatic complexity: 223 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:47:33,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:47:33,910 INFO L93 Difference]: Finished difference Result 361 states and 632 transitions. [2024-10-25 00:47:33,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 361 states and 632 transitions. [2024-10-25 00:47:33,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 177 [2024-10-25 00:47:33,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 361 states to 361 states and 632 transitions. [2024-10-25 00:47:33,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 361 [2024-10-25 00:47:33,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 361 [2024-10-25 00:47:33,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 361 states and 632 transitions. [2024-10-25 00:47:33,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:47:33,923 INFO L218 hiAutomatonCegarLoop]: Abstraction has 361 states and 632 transitions. [2024-10-25 00:47:33,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states and 632 transitions. [2024-10-25 00:47:33,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2024-10-25 00:47:33,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 361 states have (on average 1.7506925207756232) internal successors, (632), 360 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:47:33,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 632 transitions. [2024-10-25 00:47:33,943 INFO L240 hiAutomatonCegarLoop]: Abstraction has 361 states and 632 transitions. [2024-10-25 00:47:33,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 00:47:33,944 INFO L425 stractBuchiCegarLoop]: Abstraction has 361 states and 632 transitions. [2024-10-25 00:47:33,944 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-25 00:47:33,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 361 states and 632 transitions. [2024-10-25 00:47:33,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 177 [2024-10-25 00:47:33,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:47:33,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:47:33,947 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:47:33,947 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:47:33,948 INFO L745 eck$LassoCheckResult]: Stem: 1504#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; 1505#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1, main_#t~post50#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep14~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep21~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep23~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep24~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;assume 0 == main_#t~nondet10#1 || 1 == main_#t~nondet10#1;~ep31~0 := (if 0 == main_#t~nondet10#1 % 256 then 0 else 1);havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;assume 0 == main_#t~nondet11#1 || 1 == main_#t~nondet11#1;~ep32~0 := (if 0 == main_#t~nondet11#1 % 256 then 0 else 1);havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume 0 == main_#t~nondet12#1 || 1 == main_#t~nondet12#1;~ep34~0 := (if 0 == main_#t~nondet12#1 % 256 then 0 else 1);havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;assume 0 == main_#t~nondet13#1 || 1 == main_#t~nondet13#1;~ep41~0 := (if 0 == main_#t~nondet13#1 % 256 then 0 else 1);havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;assume 0 == main_#t~nondet14#1 || 1 == main_#t~nondet14#1;~ep42~0 := (if 0 == main_#t~nondet14#1 % 256 then 0 else 1);havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;assume 0 == main_#t~nondet15#1 || 1 == main_#t~nondet15#1;~ep43~0 := (if 0 == main_#t~nondet15#1 % 256 then 0 else 1);havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;assume 0 == main_#t~nondet22#1 || 1 == main_#t~nondet22#1;~mode1~0 := (if 0 == main_#t~nondet22#1 % 256 then 0 else 1);havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~newmax1~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~mode2~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;assume 0 == main_#t~nondet31#1 || 1 == main_#t~nondet31#1;~newmax2~0 := (if 0 == main_#t~nondet31#1 % 256 then 0 else 1);havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;assume 0 == main_#t~nondet38#1 || 1 == main_#t~nondet38#1;~mode3~0 := (if 0 == main_#t~nondet38#1 % 256 then 0 else 1);havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;assume 0 == main_#t~nondet39#1 || 1 == main_#t~nondet39#1;~newmax3~0 := (if 0 == main_#t~nondet39#1 % 256 then 0 else 1);havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~id4~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~r4~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~st4~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;~nl4~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;havoc main_#t~nondet44#1;~m4~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;havoc main_#t~nondet45#1;~max4~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;havoc main_#t~nondet46#1;assume 0 == main_#t~nondet46#1 || 1 == main_#t~nondet46#1;~mode4~0 := (if 0 == main_#t~nondet46#1 % 256 then 0 else 1);havoc main_#t~nondet46#1;havoc main_#t~nondet47#1;assume 0 == main_#t~nondet47#1 || 1 == main_#t~nondet47#1;~newmax4~0 := (if 0 == main_#t~nondet47#1 % 256 then 0 else 1);havoc main_#t~nondet47#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r141~0#1 := (if 0 == ~ep14~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r241~0#1 := (if 0 == ~ep24~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1);init_~r341~0#1 := (if 0 == ~ep34~0 % 256 then 0 else 1);init_~r411~0#1 := (if 0 == ~ep41~0 % 256 then 0 else 1);init_~r421~0#1 := (if 0 == ~ep42~0 % 256 then 0 else 1);init_~r431~0#1 := (if 0 == ~ep43~0 % 256 then 0 else 1); 1311#L441 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 1312#L452 init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 1435#L462 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 1398#L473 init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 1464#L483 assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 1370#L494 init_~r142~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 1526#L504 assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 1337#L515 init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 1247#L525 assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 1248#L536 init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 1349#L546 assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 1350#L557 init_~r242~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 1376#L567 assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 1290#L578 init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___5~0#1 then 0 else 1) % 256 then 0 else 1); 1441#L588 assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 1298#L599 init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___6~0#1 then 0 else 1) % 256 then 0 else 1); 1433#L609 assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 1355#L620 init_~r342~0#1 := (if 0 == (if 0 == init_~tmp___7~0#1 then 0 else 1) % 256 then 0 else 1); 1396#L630 assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 1365#L641 init_~r412~0#1 := (if 0 == (if 0 == init_~tmp___8~0#1 then 0 else 1) % 256 then 0 else 1); 1511#L651 assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 1300#L662 init_~r422~0#1 := (if 0 == (if 0 == init_~tmp___9~0#1 then 0 else 1) % 256 then 0 else 1); 1460#L672 assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 1461#L683 init_~r432~0#1 := (if 0 == (if 0 == init_~tmp___10~0#1 then 0 else 1) % 256 then 0 else 1); 1527#L693 assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 1383#L704 init_~r123~0#1 := (if 0 == (if 0 == init_~tmp___11~0#1 then 0 else 1) % 256 then 0 else 1); 1487#L714 assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 1276#L725 init_~r133~0#1 := (if 0 == (if 0 == init_~tmp___12~0#1 then 0 else 1) % 256 then 0 else 1); 1277#L735 assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 1251#L746 init_~r143~0#1 := (if 0 == (if 0 == init_~tmp___13~0#1 then 0 else 1) % 256 then 0 else 1); 1427#L756 assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 1269#L767 init_~r213~0#1 := (if 0 == (if 0 == init_~tmp___14~0#1 then 0 else 1) % 256 then 0 else 1); 1316#L777 assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 1317#L788 init_~r233~0#1 := (if 0 == (if 0 == init_~tmp___15~0#1 then 0 else 1) % 256 then 0 else 1); 1474#L798 assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 1483#L809 init_~r243~0#1 := (if 0 == (if 0 == init_~tmp___16~0#1 then 0 else 1) % 256 then 0 else 1); 1515#L819 assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 1272#L830 init_~r313~0#1 := (if 0 == (if 0 == init_~tmp___17~0#1 then 0 else 1) % 256 then 0 else 1); 1456#L840 assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 1255#L851 init_~r323~0#1 := (if 0 == (if 0 == init_~tmp___18~0#1 then 0 else 1) % 256 then 0 else 1); 1507#L861 assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 1360#L872 init_~r343~0#1 := (if 0 == (if 0 == init_~tmp___19~0#1 then 0 else 1) % 256 then 0 else 1); 1510#L882 assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 1340#L893 init_~r413~0#1 := (if 0 == (if 0 == init_~tmp___20~0#1 then 0 else 1) % 256 then 0 else 1); 1434#L903 assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 1402#L914 init_~r423~0#1 := (if 0 == (if 0 == init_~tmp___21~0#1 then 0 else 1) % 256 then 0 else 1); 1431#L924 assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 1419#L935 init_~r433~0#1 := (if 0 == (if 0 == init_~tmp___22~0#1 then 0 else 1) % 256 then 0 else 1); 1420#L945 assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 1260#L945-1 init_#res#1 := init_~tmp___23~0#1; 1444#init_returnLabel#1 main_#t~ret48#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 1445#L21 assume !(0 == assume_abort_if_not_~cond#1); 1448#L20 havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 1493#L1223-2 [2024-10-25 00:47:33,948 INFO L747 eck$LassoCheckResult]: Loop: 1493#L1223-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 1387#L114 assume !(0 != ~mode1~0 % 256); 1389#L150 assume ~r1~0 < 3; 1439#L151 assume !(0 != ~ep12~0 % 256); 1335#L151-1 assume !(0 != ~ep13~0 % 256); 1267#L156 assume !(0 != ~ep14~0 % 256); 1467#L150-1 ~mode1~0 := 1; 1594#L114-2 havoc node1_~newmax~0#1;assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 1593#L178 assume !(0 != ~mode2~0 % 256); 1578#L214 assume !(~r2~0 < 3); 1574#L214-1 ~mode2~0 := 1; 1571#L178-2 havoc node2_~newmax~1#1;assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 1568#L242 assume !(0 != ~mode3~0 % 256); 1564#L278 assume !(~r3~0 < 3); 1561#L278-1 ~mode3~0 := 1; 1559#L242-2 havoc node3_~newmax~2#1;assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0; 1557#L306 assume !(0 != ~mode4~0 % 256); 1543#L342 assume !(~r4~0 < 3); 1541#L342-1 ~mode4~0 := 1; 1540#L306-2 havoc node4_~newmax~3#1;assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1539#L1090 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 1538#L1091 assume ~st1~0 + ~nl1~0 <= 1; 1537#L1092 assume ~st2~0 + ~nl2~0 <= 1; 1536#L1093 assume ~st3~0 + ~nl3~0 <= 1; 1535#L1094 assume ~st4~0 + ~nl4~0 <= 1; 1534#L1095 assume !(~r1~0 >= 3); 1429#L1098 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 1430#$Ultimate##678 assume ~r1~0 < 3; 1603#$Ultimate##682 assume !(~r1~0 >= 3); 1314#L1108 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0; 1315#$Ultimate##686 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 1604#L1090-1 check_#res#1 := check_~tmp~1#1; 1602#check_returnLabel#1 main_#t~ret49#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret49#1;havoc main_#t~ret49#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 1323#L1266 assume !(0 == assert_~arg#1 % 256); 1324#L1261 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post50#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post50#1;havoc main_#t~post50#1; 1493#L1223-2 [2024-10-25 00:47:33,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:47:33,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1995424982, now seen corresponding path program 3 times [2024-10-25 00:47:33,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:47:33,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520048616] [2024-10-25 00:47:33,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:47:33,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:47:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:47:34,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:47:34,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:47:34,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520048616] [2024-10-25 00:47:34,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520048616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:47:34,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:47:34,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-25 00:47:34,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173408410] [2024-10-25 00:47:34,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:47:34,112 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:47:34,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:47:34,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1451701006, now seen corresponding path program 1 times [2024-10-25 00:47:34,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:47:34,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988681543] [2024-10-25 00:47:34,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:47:34,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:47:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:47:34,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:47:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:47:34,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:47:35,024 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:47:35,025 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:47:35,025 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:47:35,025 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:47:35,025 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-25 00:47:35,025 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:47:35,026 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:47:35,026 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:47:35,026 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2024-10-25 00:47:35,026 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:47:35,026 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:47:35,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:35,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:35,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:35,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:35,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:35,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:35,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:35,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:35,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:35,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:35,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:35,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:35,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:35,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:35,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:35,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:35,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:35,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:35,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:35,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:35,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:35,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:35,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:35,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:35,723 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:47:35,724 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-25 00:47:35,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:47:35,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:47:35,728 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:47:35,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-25 00:47:35,731 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:47:35,731 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:47:35,750 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-25 00:47:35,750 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_node4_~newmax~3#1=0} Honda state: {ULTIMATE.start_node4_~newmax~3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-25 00:47:35,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-25 00:47:35,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:47:35,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:47:35,771 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:47:35,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-25 00:47:35,774 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:47:35,774 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:47:35,788 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-25 00:47:35,789 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_assert_#in~arg#1=0} Honda state: {ULTIMATE.start_assert_#in~arg#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-25 00:47:35,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-25 00:47:35,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:47:35,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:47:35,802 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:47:35,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-25 00:47:35,804 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:47:35,804 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:47:35,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-25 00:47:35,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:47:35,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:47:35,831 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:47:35,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-25 00:47:35,832 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-25 00:47:35,833 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:47:36,011 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-25 00:47:36,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-25 00:47:36,016 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:47:36,016 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:47:36,017 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:47:36,017 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:47:36,017 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:47:36,017 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:47:36,017 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:47:36,017 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:47:36,017 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2024-10-25 00:47:36,017 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:47:36,017 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:47:36,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:36,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:36,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:36,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:36,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:36,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:36,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:36,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:36,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:36,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:36,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:36,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:36,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:36,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:36,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:36,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:36,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:36,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:36,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:36,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:36,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:36,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:36,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:36,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:47:36,622 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:47:36,627 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:47:36,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:47:36,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:47:36,630 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:47:36,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-25 00:47:36,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:47:36,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:47:36,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:47:36,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:47:36,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:47:36,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:47:36,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:47:36,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:47:36,647 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:47:36,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-25 00:47:36,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:47:36,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:47:36,663 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:47:36,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-25 00:47:36,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:47:36,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:47:36,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:47:36,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:47:36,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:47:36,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:47:36,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:47:36,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:47:36,683 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:47:36,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-25 00:47:36,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:47:36,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:47:36,698 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:47:36,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-25 00:47:36,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:47:36,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:47:36,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:47:36,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:47:36,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:47:36,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:47:36,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:47:36,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:47:36,719 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:47:36,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-25 00:47:36,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:47:36,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:47:36,734 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:47:36,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-25 00:47:36,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:47:36,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:47:36,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:47:36,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:47:36,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:47:36,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:47:36,761 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:47:36,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:47:36,770 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:47:36,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-25 00:47:36,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:47:36,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:47:36,783 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:47:36,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-25 00:47:36,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:47:36,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:47:36,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:47:36,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:47:36,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:47:36,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:47:36,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:47:36,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:47:36,798 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:47:36,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-25 00:47:36,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:47:36,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:47:36,811 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:47:36,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-25 00:47:36,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:47:36,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:47:36,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:47:36,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:47:36,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:47:36,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:47:36,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:47:36,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:47:36,829 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:47:36,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-25 00:47:36,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:47:36,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:47:36,843 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:47:36,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-25 00:47:36,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:47:36,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:47:36,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:47:36,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:47:36,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:47:36,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:47:36,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:47:36,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:47:36,859 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:47:36,861 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-25 00:47:36,861 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-25 00:47:36,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:47:36,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:47:36,864 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:47:36,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-25 00:47:36,866 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:47:36,867 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-25 00:47:36,867 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:47:36,867 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 15 Supporting invariants [] [2024-10-25 00:47:36,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-25 00:47:36,880 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-25 00:47:36,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:47:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:47:36,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:47:36,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:47:37,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-25 00:47:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:47:37,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:47:37,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:47:37,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:47:37,226 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-25 00:47:37,227 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 361 states and 632 transitions. cyclomatic complexity: 272 Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:47:37,294 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 361 states and 632 transitions. cyclomatic complexity: 272. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 537 states and 926 transitions. Complement of second has 4 states. [2024-10-25 00:47:37,295 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 [2024-10-25 00:47:37,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:47:37,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2024-10-25 00:47:37,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 504 transitions. Stem has 55 letters. Loop has 35 letters. [2024-10-25 00:47:37,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:47:37,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 504 transitions. Stem has 90 letters. Loop has 35 letters. [2024-10-25 00:47:37,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:47:37,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 504 transitions. Stem has 55 letters. Loop has 70 letters. [2024-10-25 00:47:37,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:47:37,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 537 states and 926 transitions. [2024-10-25 00:47:37,307 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-25 00:47:37,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 537 states to 0 states and 0 transitions. [2024-10-25 00:47:37,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-25 00:47:37,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-25 00:47:37,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-25 00:47:37,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:47:37,308 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:47:37,308 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:47:37,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:47:37,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-25 00:47:37,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-25 00:47:37,309 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:47:37,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:47:37,309 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2024-10-25 00:47:37,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2024-10-25 00:47:37,309 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-25 00:47:37,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2024-10-25 00:47:37,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-25 00:47:37,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-25 00:47:37,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-25 00:47:37,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:47:37,310 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:47:37,310 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:47:37,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 00:47:37,311 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:47:37,312 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-25 00:47:37,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-25 00:47:37,312 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-25 00:47:37,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-25 00:47:37,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 25.10 12:47:37 BoogieIcfgContainer [2024-10-25 00:47:37,322 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-25 00:47:37,322 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-25 00:47:37,322 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-25 00:47:37,322 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-25 00:47:37,323 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:47:32" (3/4) ... [2024-10-25 00:47:37,324 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-25 00:47:37,325 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-25 00:47:37,326 INFO L158 Benchmark]: Toolchain (without parser) took 6510.65ms. Allocated memory was 190.8MB in the beginning and 302.0MB in the end (delta: 111.1MB). Free memory was 153.6MB in the beginning and 216.4MB in the end (delta: -62.8MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2024-10-25 00:47:37,326 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 111.1MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-25 00:47:37,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.64ms. Allocated memory is still 190.8MB. Free memory was 153.0MB in the beginning and 126.4MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-25 00:47:37,326 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.03ms. Allocated memory is still 190.8MB. Free memory was 126.4MB in the beginning and 120.9MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-25 00:47:37,327 INFO L158 Benchmark]: Boogie Preprocessor took 96.08ms. Allocated memory is still 190.8MB. Free memory was 120.9MB in the beginning and 114.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-25 00:47:37,327 INFO L158 Benchmark]: RCFGBuilder took 1048.50ms. Allocated memory is still 190.8MB. Free memory was 114.6MB in the beginning and 78.1MB in the end (delta: 36.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-25 00:47:37,327 INFO L158 Benchmark]: BuchiAutomizer took 4870.34ms. Allocated memory was 190.8MB in the beginning and 302.0MB in the end (delta: 111.1MB). Free memory was 78.1MB in the beginning and 217.4MB in the end (delta: -139.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-25 00:47:37,327 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 302.0MB. Free memory was 217.4MB in the beginning and 216.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-25 00:47:37,329 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 111.1MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 423.64ms. Allocated memory is still 190.8MB. Free memory was 153.0MB in the beginning and 126.4MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.03ms. Allocated memory is still 190.8MB. Free memory was 126.4MB in the beginning and 120.9MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.08ms. Allocated memory is still 190.8MB. Free memory was 120.9MB in the beginning and 114.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1048.50ms. Allocated memory is still 190.8MB. Free memory was 114.6MB in the beginning and 78.1MB in the end (delta: 36.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 4870.34ms. Allocated memory was 190.8MB in the beginning and 302.0MB in the end (delta: 111.1MB). Free memory was 78.1MB in the beginning and 217.4MB in the end (delta: -139.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 302.0MB. Free memory was 217.4MB in the beginning and 216.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (15 + ((long long) -2 * i2)) and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 612 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 611 mSDsluCounter, 3697 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2177 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39 IncrementalHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 1520 mSDtfsCounter, 39 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital175 mio100 ax100 hnf100 lsp42 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-25 00:47:37,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE