./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_floodmax.4.2.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 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_floodmax.4.2.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 86aaf7922fe6f7f87277fe3baca1629811408ccdafec5bb956830ba2f5ff28a9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 01:02:00,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 01:02:00,931 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-15 01:02:00,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 01:02:00,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 01:02:00,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 01:02:00,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 01:02:00,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 01:02:00,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 01:02:00,975 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 01:02:00,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 01:02:00,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 01:02:00,976 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 01:02:00,977 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 01:02:00,979 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 01:02:00,979 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 01:02:00,979 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 01:02:00,980 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 01:02:00,980 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 01:02:00,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 01:02:00,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 01:02:00,985 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 01:02:00,985 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 01:02:00,985 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 01:02:00,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 01:02:00,986 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 01:02:00,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 01:02:00,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 01:02:00,987 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 01:02:00,987 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 01:02:00,987 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 01:02:00,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 01:02:00,987 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 01:02:00,988 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 01:02:00,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 01:02:00,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 01:02:00,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 01:02:00,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 01:02:00,989 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 01:02:00,989 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 -> 86aaf7922fe6f7f87277fe3baca1629811408ccdafec5bb956830ba2f5ff28a9 [2024-10-15 01:02:01,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 01:02:01,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 01:02:01,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 01:02:01,321 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 01:02:01,321 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 01:02:01,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c [2024-10-15 01:02:02,796 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 01:02:03,020 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 01:02:03,021 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c [2024-10-15 01:02:03,038 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5158c38e2/ed7623e088f743c3bfd365a42c1f7e92/FLAGc0e4cd60e [2024-10-15 01:02:03,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5158c38e2/ed7623e088f743c3bfd365a42c1f7e92 [2024-10-15 01:02:03,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 01:02:03,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 01:02:03,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 01:02:03,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 01:02:03,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 01:02:03,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:02:03" (1/1) ... [2024-10-15 01:02:03,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@426a4bb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:02:03, skipping insertion in model container [2024-10-15 01:02:03,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:02:03" (1/1) ... [2024-10-15 01:02:03,434 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 01:02:03,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 01:02:03,822 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 01:02:03,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 01:02:03,921 INFO L204 MainTranslator]: Completed translation [2024-10-15 01:02:03,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:02:03 WrapperNode [2024-10-15 01:02:03,921 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 01:02:03,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 01:02:03,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 01:02:03,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 01:02:03,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:02:03" (1/1) ... [2024-10-15 01:02:03,951 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:02:03" (1/1) ... [2024-10-15 01:02:04,015 INFO L138 Inliner]: procedures = 23, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 933 [2024-10-15 01:02:04,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 01:02:04,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 01:02:04,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 01:02:04,021 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 01:02:04,032 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:02:03" (1/1) ... [2024-10-15 01:02:04,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:02:03" (1/1) ... [2024-10-15 01:02:04,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:02:03" (1/1) ... [2024-10-15 01:02:04,068 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-15 01:02:04,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:02:03" (1/1) ... [2024-10-15 01:02:04,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:02:03" (1/1) ... [2024-10-15 01:02:04,084 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:02:03" (1/1) ... [2024-10-15 01:02:04,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:02:03" (1/1) ... [2024-10-15 01:02:04,104 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:02:03" (1/1) ... [2024-10-15 01:02:04,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:02:03" (1/1) ... [2024-10-15 01:02:04,115 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 01:02:04,116 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 01:02:04,116 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 01:02:04,116 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 01:02:04,117 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:02:03" (1/1) ... [2024-10-15 01:02:04,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:02:04,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:02:04,159 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-15 01:02:04,161 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-15 01:02:04,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 01:02:04,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 01:02:04,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 01:02:04,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 01:02:04,432 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 01:02:04,435 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 01:02:05,376 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2024-10-15 01:02:05,376 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 01:02:05,404 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 01:02:05,404 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-15 01:02:05,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:02:05 BoogieIcfgContainer [2024-10-15 01:02:05,405 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 01:02:05,406 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 01:02:05,406 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 01:02:05,413 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 01:02:05,414 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 01:02:05,414 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 01:02:03" (1/3) ... [2024-10-15 01:02:05,417 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1af2c2ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 01:02:05, skipping insertion in model container [2024-10-15 01:02:05,417 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 01:02:05,417 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:02:03" (2/3) ... [2024-10-15 01:02:05,417 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1af2c2ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 01:02:05, skipping insertion in model container [2024-10-15 01:02:05,418 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 01:02:05,418 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:02:05" (3/3) ... [2024-10-15 01:02:05,420 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.4.2.ufo.BOUNDED-8.pals.c [2024-10-15 01:02:05,527 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 01:02:05,527 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 01:02:05,528 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 01:02:05,528 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 01:02:05,528 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 01:02:05,528 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 01:02:05,528 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 01:02:05,528 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 01:02:05,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 280 states, 279 states have (on average 1.8279569892473118) internal successors, (510), 279 states have internal predecessors, (510), 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-15 01:02:05,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 84 [2024-10-15 01:02:05,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 01:02:05,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 01:02:05,596 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-15 01:02:05,596 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-15 01:02:05,596 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 01:02:05,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 280 states, 279 states have (on average 1.8279569892473118) internal successors, (510), 279 states have internal predecessors, (510), 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-15 01:02:05,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 84 [2024-10-15 01:02:05,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 01:02:05,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 01:02:05,614 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-15 01:02:05,614 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-15 01:02:05,623 INFO L745 eck$LassoCheckResult]: Stem: 182#$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(39, 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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0; 194#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~ret44#1, main_#t~ret45#1, main_#t~post46#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;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;assume 0 == main_#t~nondet29#1 || 1 == main_#t~nondet29#1;~mode2~0 := (if 0 == main_#t~nondet29#1 % 256 then 0 else 1);havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~mode3~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;~id4~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;~r4~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;~st4~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~nl4~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~m4~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~max4~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~mode4~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#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); 161#L393true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 122#L404true init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 275#L414true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 260#L425true init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 245#L435true assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 258#L446true init_~r142~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 112#L456true assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 137#L467true init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 180#L477true assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 63#L488true init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 81#L498true assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 43#L509true init_~r242~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 233#L519true assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 38#L530true init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___5~0#1 then 0 else 1) % 256 then 0 else 1); 174#L540true assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 183#L551true init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___6~0#1 then 0 else 1) % 256 then 0 else 1); 65#L561true assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 108#L572true init_~r342~0#1 := (if 0 == (if 0 == init_~tmp___7~0#1 then 0 else 1) % 256 then 0 else 1); 279#L582true assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 69#L593true init_~r412~0#1 := (if 0 == (if 0 == init_~tmp___8~0#1 then 0 else 1) % 256 then 0 else 1); 272#L603true assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 192#L614true init_~r422~0#1 := (if 0 == (if 0 == init_~tmp___9~0#1 then 0 else 1) % 256 then 0 else 1); 197#L624true assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 21#L635true init_~r432~0#1 := (if 0 == (if 0 == init_~tmp___10~0#1 then 0 else 1) % 256 then 0 else 1); 145#L645true assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 96#L656true init_~r123~0#1 := (if 0 == (if 0 == init_~tmp___11~0#1 then 0 else 1) % 256 then 0 else 1); 156#L666true assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 7#L677true init_~r133~0#1 := (if 0 == (if 0 == init_~tmp___12~0#1 then 0 else 1) % 256 then 0 else 1); 51#L687true assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 246#L698true init_~r143~0#1 := (if 0 == (if 0 == init_~tmp___13~0#1 then 0 else 1) % 256 then 0 else 1); 11#L708true assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 221#L719true init_~r213~0#1 := (if 0 == (if 0 == init_~tmp___14~0#1 then 0 else 1) % 256 then 0 else 1); 190#L729true assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 201#L740true init_~r233~0#1 := (if 0 == (if 0 == init_~tmp___15~0#1 then 0 else 1) % 256 then 0 else 1); 256#L750true assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 91#L761true init_~r243~0#1 := (if 0 == (if 0 == init_~tmp___16~0#1 then 0 else 1) % 256 then 0 else 1); 249#L771true assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 128#L782true init_~r313~0#1 := (if 0 == (if 0 == init_~tmp___17~0#1 then 0 else 1) % 256 then 0 else 1); 155#L792true assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 19#L803true init_~r323~0#1 := (if 0 == (if 0 == init_~tmp___18~0#1 then 0 else 1) % 256 then 0 else 1); 40#L813true assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 250#L824true init_~r343~0#1 := (if 0 == (if 0 == init_~tmp___19~0#1 then 0 else 1) % 256 then 0 else 1); 121#L834true assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 124#L845true init_~r413~0#1 := (if 0 == (if 0 == init_~tmp___20~0#1 then 0 else 1) % 256 then 0 else 1); 13#L855true assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 152#L866true init_~r423~0#1 := (if 0 == (if 0 == init_~tmp___21~0#1 then 0 else 1) % 256 then 0 else 1); 90#L876true assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 131#L887true init_~r433~0#1 := (if 0 == (if 0 == init_~tmp___22~0#1 then 0 else 1) % 256 then 0 else 1); 150#L897true assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 113#L897-1true init_#res#1 := init_~tmp___23~0#1; 87#init_returnLabel#1true main_#t~ret44#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~ret44#1;havoc main_#t~ret44#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; 100#L21true assume !(0 == assume_abort_if_not_~cond#1); 158#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; 94#L1203-2true [2024-10-15 01:02:05,624 INFO L747 eck$LassoCheckResult]: Loop: 94#L1203-2true assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true; 115#L109true assume !(0 != ~mode1~0 % 256); 42#L141true assume !(~r1~0 < 3); 265#L141-1true ~mode1~0 := 1; 134#L109-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true; 186#L162true assume !(0 != ~mode2~0 % 256); 247#L194true assume !(~r2~0 < 3); 4#L194-1true ~mode2~0 := 1; 54#L162-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true; 142#L215true assume !(0 != ~mode3~0 % 256); 110#L247true assume !(~r3~0 < 3); 266#L247-1true ~mode3~0 := 1; 273#L215-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true; 169#L268true assume !(0 != ~mode4~0 % 256); 218#L300true assume !(~r4~0 < 3); 44#L300-1true ~mode4~0 := 1; 253#L268-2true 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; 189#L1074true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 185#L1074-1true check_#res#1 := check_~tmp~1#1; 162#check_returnLabel#1true main_#t~ret45#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret45#1;havoc main_#t~ret45#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; 37#L1246true assume !(0 == assert_~arg#1 % 256); 32#L1241true havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post46#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post46#1;havoc main_#t~post46#1; 94#L1203-2true [2024-10-15 01:02:05,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:02:05,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2041231622, now seen corresponding path program 1 times [2024-10-15 01:02:05,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:02:05,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043630054] [2024-10-15 01:02:05,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:02:05,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:02:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:02:06,346 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-15 01:02:06,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:02:06,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043630054] [2024-10-15 01:02:06,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043630054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:02:06,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:02:06,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 01:02:06,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755636586] [2024-10-15 01:02:06,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:02:06,356 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 01:02:06,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:02:06,360 INFO L85 PathProgramCache]: Analyzing trace with hash -85183311, now seen corresponding path program 1 times [2024-10-15 01:02:06,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:02:06,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134920575] [2024-10-15 01:02:06,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:02:06,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:02:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:02:06,539 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-15 01:02:06,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:02:06,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134920575] [2024-10-15 01:02:06,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134920575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:02:06,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:02:06,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 01:02:06,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674292537] [2024-10-15 01:02:06,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:02:06,543 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 01:02:06,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 01:02:06,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 01:02:06,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 01:02:06,576 INFO L87 Difference]: Start difference. First operand has 280 states, 279 states have (on average 1.8279569892473118) internal successors, (510), 279 states have internal predecessors, (510), 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-15 01:02:06,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 01:02:06,674 INFO L93 Difference]: Finished difference Result 282 states and 509 transitions. [2024-10-15 01:02:06,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 282 states and 509 transitions. [2024-10-15 01:02:06,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 82 [2024-10-15 01:02:06,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 282 states to 274 states and 492 transitions. [2024-10-15 01:02:06,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 274 [2024-10-15 01:02:06,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 274 [2024-10-15 01:02:06,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 274 states and 492 transitions. [2024-10-15 01:02:06,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 01:02:06,691 INFO L218 hiAutomatonCegarLoop]: Abstraction has 274 states and 492 transitions. [2024-10-15 01:02:06,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states and 492 transitions. [2024-10-15 01:02:06,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2024-10-15 01:02:06,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 274 states have (on average 1.7956204379562044) internal successors, (492), 273 states have internal predecessors, (492), 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-15 01:02:06,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 492 transitions. [2024-10-15 01:02:06,746 INFO L240 hiAutomatonCegarLoop]: Abstraction has 274 states and 492 transitions. [2024-10-15 01:02:06,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 01:02:06,751 INFO L425 stractBuchiCegarLoop]: Abstraction has 274 states and 492 transitions. [2024-10-15 01:02:06,751 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 01:02:06,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 274 states and 492 transitions. [2024-10-15 01:02:06,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 82 [2024-10-15 01:02:06,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 01:02:06,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 01:02:06,756 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-15 01:02:06,756 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-15 01:02:06,757 INFO L745 eck$LassoCheckResult]: Stem: 816#$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(39, 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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0; 817#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~ret44#1, main_#t~ret45#1, main_#t~post46#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;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;assume 0 == main_#t~nondet29#1 || 1 == main_#t~nondet29#1;~mode2~0 := (if 0 == main_#t~nondet29#1 % 256 then 0 else 1);havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~mode3~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;~id4~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;~r4~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;~st4~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~nl4~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~m4~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~max4~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~mode4~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#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); 808#L393 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 716#L404 init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 777#L414 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 613#L425 init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 848#L435 assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 661#L446 init_~r142~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 764#L456 assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 690#L467 init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 792#L477 assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 693#L488 init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 699#L498 assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 650#L509 init_~r242~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 667#L519 assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 602#L530 init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___5~0#1 then 0 else 1) % 256 then 0 else 1); 653#L540 assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 721#L551 init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___6~0#1 then 0 else 1) % 256 then 0 else 1); 701#L561 assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 679#L572 init_~r342~0#1 := (if 0 == (if 0 == init_~tmp___7~0#1 then 0 else 1) % 256 then 0 else 1); 760#L582 assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 656#L593 init_~r412~0#1 := (if 0 == (if 0 == init_~tmp___8~0#1 then 0 else 1) % 256 then 0 else 1); 708#L603 assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 639#L614 init_~r422~0#1 := (if 0 == (if 0 == init_~tmp___9~0#1 then 0 else 1) % 256 then 0 else 1); 823#L624 assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 623#L635 init_~r432~0#1 := (if 0 == (if 0 == init_~tmp___10~0#1 then 0 else 1) % 256 then 0 else 1); 624#L645 assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 676#L656 init_~r123~0#1 := (if 0 == (if 0 == init_~tmp___11~0#1 then 0 else 1) % 256 then 0 else 1); 744#L666 assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 590#L677 init_~r133~0#1 := (if 0 == (if 0 == init_~tmp___12~0#1 then 0 else 1) % 256 then 0 else 1); 591#L687 assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 646#L698 init_~r143~0#1 := (if 0 == (if 0 == init_~tmp___13~0#1 then 0 else 1) % 256 then 0 else 1); 598#L708 assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 599#L719 init_~r213~0#1 := (if 0 == (if 0 == init_~tmp___14~0#1 then 0 else 1) % 256 then 0 else 1); 821#L729 assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 746#L740 init_~r233~0#1 := (if 0 == (if 0 == init_~tmp___15~0#1 then 0 else 1) % 256 then 0 else 1); 828#L750 assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 738#L761 init_~r243~0#1 := (if 0 == (if 0 == init_~tmp___16~0#1 then 0 else 1) % 256 then 0 else 1); 739#L771 assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 589#L782 init_~r313~0#1 := (if 0 == (if 0 == init_~tmp___17~0#1 then 0 else 1) % 256 then 0 else 1); 783#L792 assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 578#L803 init_~r323~0#1 := (if 0 == (if 0 == init_~tmp___18~0#1 then 0 else 1) % 256 then 0 else 1); 619#L813 assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 657#L824 init_~r343~0#1 := (if 0 == (if 0 == init_~tmp___19~0#1 then 0 else 1) % 256 then 0 else 1); 776#L834 assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 636#L845 init_~r413~0#1 := (if 0 == (if 0 == init_~tmp___20~0#1 then 0 else 1) % 256 then 0 else 1); 604#L855 assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 605#L866 init_~r423~0#1 := (if 0 == (if 0 == init_~tmp___21~0#1 then 0 else 1) % 256 then 0 else 1); 737#L876 assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 618#L887 init_~r433~0#1 := (if 0 == (if 0 == init_~tmp___22~0#1 then 0 else 1) % 256 then 0 else 1); 786#L897 assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 580#L897-1 init_#res#1 := init_~tmp___23~0#1; 734#init_returnLabel#1 main_#t~ret44#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~ret44#1;havoc main_#t~ret44#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; 735#L21 assume !(0 == assume_abort_if_not_~cond#1); 752#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; 643#L1203-2 [2024-10-15 01:02:06,760 INFO L747 eck$LassoCheckResult]: Loop: 643#L1203-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true; 742#L109 assume !(0 != ~mode1~0 % 256); 662#L141 assume !(~r1~0 < 3); 664#L141-1 ~mode1~0 := 1; 788#L109-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true; 789#L162 assume !(0 != ~mode2~0 % 256); 819#L194 assume !(~r2~0 < 3); 582#L194-1 ~mode2~0 := 1; 583#L162-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true; 687#L215 assume !(0 != ~mode3~0 % 256); 762#L247 assume !(~r3~0 < 3); 630#L247-1 ~mode3~0 := 1; 814#L215-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true; 810#L268 assume !(0 != ~mode4~0 % 256); 811#L300 assume !(~r4~0 < 3); 665#L300-1 ~mode4~0 := 1; 666#L268-2 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; 820#L1074 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 767#L1075 assume ~st1~0 + ~nl1~0 <= 1; 768#L1076 assume ~st2~0 + ~nl2~0 <= 1; 791#L1077 assume ~st3~0 + ~nl3~0 <= 1; 674#L1078 assume ~st4~0 + ~nl4~0 <= 1; 595#L1079 assume ~r1~0 >= 3; 596#$Ultimate##666 assume ~r1~0 < 3; 797#$Ultimate##670 assume ~r1~0 >= 3; 757#$Ultimate##674 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 758#L1074-1 check_#res#1 := check_~tmp~1#1; 807#check_returnLabel#1 main_#t~ret45#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret45#1;havoc main_#t~ret45#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; 652#L1246 assume !(0 == assert_~arg#1 % 256); 642#L1241 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post46#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post46#1;havoc main_#t~post46#1; 643#L1203-2 [2024-10-15 01:02:06,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:02:06,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2041231622, now seen corresponding path program 2 times [2024-10-15 01:02:06,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:02:06,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952613435] [2024-10-15 01:02:06,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:02:06,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:02:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:02:07,038 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-15 01:02:07,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:02:07,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952613435] [2024-10-15 01:02:07,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952613435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:02:07,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:02:07,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 01:02:07,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552993793] [2024-10-15 01:02:07,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:02:07,042 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 01:02:07,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:02:07,043 INFO L85 PathProgramCache]: Analyzing trace with hash -31942528, now seen corresponding path program 1 times [2024-10-15 01:02:07,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:02:07,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65351797] [2024-10-15 01:02:07,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:02:07,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:02:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:02:07,113 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-15 01:02:07,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:02:07,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65351797] [2024-10-15 01:02:07,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65351797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:02:07,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:02:07,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 01:02:07,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171571480] [2024-10-15 01:02:07,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:02:07,116 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 01:02:07,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 01:02:07,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 01:02:07,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 01:02:07,117 INFO L87 Difference]: Start difference. First operand 274 states and 492 transitions. cyclomatic complexity: 219 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-15 01:02:07,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 01:02:07,183 INFO L93 Difference]: Finished difference Result 340 states and 598 transitions. [2024-10-15 01:02:07,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 340 states and 598 transitions. [2024-10-15 01:02:07,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 148 [2024-10-15 01:02:07,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 340 states to 340 states and 598 transitions. [2024-10-15 01:02:07,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 340 [2024-10-15 01:02:07,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 340 [2024-10-15 01:02:07,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 340 states and 598 transitions. [2024-10-15 01:02:07,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 01:02:07,197 INFO L218 hiAutomatonCegarLoop]: Abstraction has 340 states and 598 transitions. [2024-10-15 01:02:07,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states and 598 transitions. [2024-10-15 01:02:07,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2024-10-15 01:02:07,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 340 states have (on average 1.7588235294117647) internal successors, (598), 339 states have internal predecessors, (598), 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-15 01:02:07,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 598 transitions. [2024-10-15 01:02:07,218 INFO L240 hiAutomatonCegarLoop]: Abstraction has 340 states and 598 transitions. [2024-10-15 01:02:07,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 01:02:07,222 INFO L425 stractBuchiCegarLoop]: Abstraction has 340 states and 598 transitions. [2024-10-15 01:02:07,222 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 01:02:07,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 340 states and 598 transitions. [2024-10-15 01:02:07,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 148 [2024-10-15 01:02:07,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 01:02:07,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 01:02:07,229 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-15 01:02:07,229 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-15 01:02:07,230 INFO L745 eck$LassoCheckResult]: Stem: 1444#$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(39, 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;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0; 1445#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~ret44#1, main_#t~ret45#1, main_#t~post46#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;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;assume 0 == main_#t~nondet29#1 || 1 == main_#t~nondet29#1;~mode2~0 := (if 0 == main_#t~nondet29#1 % 256 then 0 else 1);havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_#t~nondet35#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;havoc main_#t~nondet36#1;assume 0 == main_#t~nondet36#1 || 1 == main_#t~nondet36#1;~mode3~0 := (if 0 == main_#t~nondet36#1 % 256 then 0 else 1);havoc main_#t~nondet36#1;havoc main_#t~nondet37#1;~id4~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;havoc main_#t~nondet38#1;~r4~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;havoc main_#t~nondet39#1;~st4~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;havoc main_#t~nondet40#1;~nl4~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;havoc main_#t~nondet41#1;~m4~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;havoc main_#t~nondet42#1;~max4~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;havoc main_#t~nondet43#1;assume 0 == main_#t~nondet43#1 || 1 == main_#t~nondet43#1;~mode4~0 := (if 0 == main_#t~nondet43#1 % 256 then 0 else 1);havoc main_#t~nondet43#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); 1434#L393 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 1341#L404 init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 1402#L414 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 1237#L425 init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 1476#L435 assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 1283#L446 init_~r142~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 1389#L456 assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 1312#L467 init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 1417#L477 assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 1315#L488 init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 1323#L498 assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 1272#L509 init_~r242~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 1288#L519 assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 1224#L530 init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___5~0#1 then 0 else 1) % 256 then 0 else 1); 1275#L540 assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 1346#L551 init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___6~0#1 then 0 else 1) % 256 then 0 else 1); 1324#L561 assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 1301#L572 init_~r342~0#1 := (if 0 == (if 0 == init_~tmp___7~0#1 then 0 else 1) % 256 then 0 else 1); 1385#L582 assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 1278#L593 init_~r412~0#1 := (if 0 == (if 0 == init_~tmp___8~0#1 then 0 else 1) % 256 then 0 else 1); 1331#L603 assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 1261#L614 init_~r422~0#1 := (if 0 == (if 0 == init_~tmp___9~0#1 then 0 else 1) % 256 then 0 else 1); 1451#L624 assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 1245#L635 init_~r432~0#1 := (if 0 == (if 0 == init_~tmp___10~0#1 then 0 else 1) % 256 then 0 else 1); 1246#L645 assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 1298#L656 init_~r123~0#1 := (if 0 == (if 0 == init_~tmp___11~0#1 then 0 else 1) % 256 then 0 else 1); 1371#L666 assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 1213#L677 init_~r133~0#1 := (if 0 == (if 0 == init_~tmp___12~0#1 then 0 else 1) % 256 then 0 else 1); 1214#L687 assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 1268#L698 init_~r143~0#1 := (if 0 == (if 0 == init_~tmp___13~0#1 then 0 else 1) % 256 then 0 else 1); 1220#L708 assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 1221#L719 init_~r213~0#1 := (if 0 == (if 0 == init_~tmp___14~0#1 then 0 else 1) % 256 then 0 else 1); 1449#L729 assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 1373#L740 init_~r233~0#1 := (if 0 == (if 0 == init_~tmp___15~0#1 then 0 else 1) % 256 then 0 else 1); 1456#L750 assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 1363#L761 init_~r243~0#1 := (if 0 == (if 0 == init_~tmp___16~0#1 then 0 else 1) % 256 then 0 else 1); 1364#L771 assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 1212#L782 init_~r313~0#1 := (if 0 == (if 0 == init_~tmp___17~0#1 then 0 else 1) % 256 then 0 else 1); 1408#L792 assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 1201#L803 init_~r323~0#1 := (if 0 == (if 0 == init_~tmp___18~0#1 then 0 else 1) % 256 then 0 else 1); 1244#L813 assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 1279#L824 init_~r343~0#1 := (if 0 == (if 0 == init_~tmp___19~0#1 then 0 else 1) % 256 then 0 else 1); 1401#L834 assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 1258#L845 init_~r413~0#1 := (if 0 == (if 0 == init_~tmp___20~0#1 then 0 else 1) % 256 then 0 else 1); 1226#L855 assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 1227#L866 init_~r423~0#1 := (if 0 == (if 0 == init_~tmp___21~0#1 then 0 else 1) % 256 then 0 else 1); 1362#L876 assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 1240#L887 init_~r433~0#1 := (if 0 == (if 0 == init_~tmp___22~0#1 then 0 else 1) % 256 then 0 else 1); 1411#L897 assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 1203#L897-1 init_#res#1 := init_~tmp___23~0#1; 1359#init_returnLabel#1 main_#t~ret44#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~ret44#1;havoc main_#t~ret44#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; 1360#L21 assume !(0 == assume_abort_if_not_~cond#1); 1379#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; 1431#L1203-2 [2024-10-15 01:02:07,231 INFO L747 eck$LassoCheckResult]: Loop: 1431#L1203-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true; 1534#L109 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); 1396#L111 assume !(0 != ~ep21~0 % 256); 1307#L111-1 assume !(0 != ~ep31~0 % 256); 1250#L118 assume !(0 != ~ep41~0 % 256); 1458#L125 assume !(2 == ~r1~0); 1470#L132 ~mode1~0 := 0; 1413#L109-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true; 1414#L162 assume !(0 != ~mode2~0 % 256); 1447#L194 assume !(~r2~0 < 3); 1205#L194-1 ~mode2~0 := 1; 1206#L162-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true; 1309#L215 assume !(0 != ~mode3~0 % 256); 1387#L247 assume !(~r3~0 < 3); 1255#L247-1 ~mode3~0 := 1; 1442#L215-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true; 1436#L268 assume !(0 != ~mode4~0 % 256); 1437#L300 assume !(~r4~0 < 3); 1286#L300-1 ~mode4~0 := 1; 1287#L268-2 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; 1448#L1074 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 1392#L1075 assume ~st1~0 + ~nl1~0 <= 1; 1393#L1076 assume ~st2~0 + ~nl2~0 <= 1; 1416#L1077 assume ~st3~0 + ~nl3~0 <= 1; 1295#L1078 assume ~st4~0 + ~nl4~0 <= 1; 1296#L1079 assume !(~r1~0 >= 3); 1334#L1082 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 1335#$Ultimate##666 assume ~r1~0 < 3; 1482#$Ultimate##670 assume !(~r1~0 >= 3); 1439#L1092 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0; 1440#$Ultimate##674 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 1538#L1074-1 check_#res#1 := check_~tmp~1#1; 1537#check_returnLabel#1 main_#t~ret45#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret45#1;havoc main_#t~ret45#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; 1536#L1246 assume !(0 == assert_~arg#1 % 256); 1535#L1241 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post46#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post46#1;havoc main_#t~post46#1; 1431#L1203-2 [2024-10-15 01:02:07,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:02:07,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2041231622, now seen corresponding path program 3 times [2024-10-15 01:02:07,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:02:07,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991269070] [2024-10-15 01:02:07,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:02:07,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:02:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:02:07,497 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-15 01:02:07,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 01:02:07,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991269070] [2024-10-15 01:02:07,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991269070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 01:02:07,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 01:02:07,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 01:02:07,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336879652] [2024-10-15 01:02:07,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 01:02:07,500 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 01:02:07,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:02:07,501 INFO L85 PathProgramCache]: Analyzing trace with hash -392426720, now seen corresponding path program 1 times [2024-10-15 01:02:07,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 01:02:07,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217597980] [2024-10-15 01:02:07,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 01:02:07,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 01:02:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:02:07,517 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 01:02:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 01:02:07,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 01:02:08,840 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 01:02:08,841 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 01:02:08,841 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 01:02:08,841 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 01:02:08,841 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 01:02:08,842 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:02:08,842 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 01:02:08,842 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 01:02:08,842 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.4.2.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2024-10-15 01:02:08,842 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 01:02:08,843 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 01:02:08,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:08,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:08,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:08,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:08,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:08,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:08,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:08,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:08,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:08,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:08,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:08,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:08,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:08,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:08,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:08,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:08,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:09,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:09,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:09,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:09,836 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 01:02:09,837 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 01:02:09,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:02:09,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:02:09,840 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-15 01:02:09,841 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-15 01:02:09,842 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 01:02:09,842 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 01:02:09,856 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 01:02:09,857 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-15 01:02:09,868 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-15 01:02:09,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:02:09,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:02:09,870 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-15 01:02:09,873 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-15 01:02:09,874 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 01:02:09,874 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 01:02:09,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-15 01:02:09,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:02:09,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:02:09,913 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-15 01:02:09,914 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-15 01:02:09,915 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 01:02:09,915 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 01:02:10,006 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 01:02:10,012 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-15 01:02:10,012 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 01:02:10,013 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 01:02:10,013 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 01:02:10,013 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 01:02:10,013 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 01:02:10,013 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:02:10,013 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 01:02:10,013 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 01:02:10,013 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.4.2.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2024-10-15 01:02:10,013 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 01:02:10,013 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 01:02:10,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:10,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:10,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:10,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:10,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:10,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:10,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:10,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:10,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:10,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:10,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:10,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:10,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:10,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:10,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:10,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:10,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:10,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:10,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:10,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 01:02:10,977 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 01:02:10,983 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 01:02:10,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:02:10,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:02:10,986 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-15 01:02:10,987 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-15 01:02:10,988 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-15 01:02:10,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:02:10,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:02:11,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:02:11,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:02:11,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:02:11,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:02:11,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:02:11,003 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:02:11,014 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-15 01:02:11,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:02:11,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:02:11,016 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-15 01:02:11,017 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-15 01:02:11,018 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-15 01:02:11,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:02:11,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:02:11,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:02:11,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:02:11,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:02:11,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:02:11,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:02:11,032 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:02:11,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-15 01:02:11,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:02:11,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:02:11,054 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-15 01:02:11,056 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-15 01:02:11,058 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-15 01:02:11,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:02:11,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:02:11,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:02:11,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:02:11,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:02:11,085 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:02:11,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:02:11,092 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:02:11,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-15 01:02:11,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:02:11,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:02:11,110 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-15 01:02:11,112 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-15 01:02:11,113 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-15 01:02:11,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:02:11,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:02:11,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:02:11,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:02:11,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:02:11,127 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:02:11,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:02:11,129 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:02:11,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-15 01:02:11,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:02:11,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:02:11,147 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-15 01:02:11,148 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-15 01:02:11,149 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-15 01:02:11,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:02:11,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:02:11,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:02:11,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:02:11,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:02:11,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:02:11,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:02:11,166 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:02:11,181 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-15 01:02:11,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:02:11,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:02:11,183 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-15 01:02:11,185 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-15 01:02:11,186 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-15 01:02:11,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:02:11,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:02:11,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:02:11,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:02:11,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:02:11,201 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:02:11,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:02:11,203 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 01:02:11,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-15 01:02:11,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:02:11,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:02:11,215 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-15 01:02:11,216 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-15 01:02:11,218 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-15 01:02:11,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 01:02:11,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 01:02:11,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 01:02:11,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 01:02:11,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 01:02:11,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 01:02:11,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 01:02:11,232 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 01:02:11,234 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 01:02:11,235 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 01:02:11,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 01:02:11,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 01:02:11,237 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-15 01:02:11,238 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-15 01:02:11,239 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 01:02:11,239 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 01:02:11,239 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 01:02:11,240 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-15 01:02:11,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-15 01:02:11,253 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 01:02:11,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 01:02:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:02:11,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 01:02:11,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 01:02:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 01:02:11,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 01:02:11,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 01:02:11,687 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-15 01:02:11,693 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-15 01:02:11,694 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 340 states and 598 transitions. cyclomatic complexity: 259 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-15 01:02:11,784 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 340 states and 598 transitions. cyclomatic complexity: 259. 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 487 states and 842 transitions. Complement of second has 4 states. [2024-10-15 01:02:11,785 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-15 01:02:11,787 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-15 01:02:11,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2024-10-15 01:02:11,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 492 transitions. Stem has 55 letters. Loop has 35 letters. [2024-10-15 01:02:11,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 01:02:11,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 492 transitions. Stem has 90 letters. Loop has 35 letters. [2024-10-15 01:02:11,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 01:02:11,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 492 transitions. Stem has 55 letters. Loop has 70 letters. [2024-10-15 01:02:11,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 01:02:11,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 487 states and 842 transitions. [2024-10-15 01:02:11,801 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 01:02:11,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 487 states to 0 states and 0 transitions. [2024-10-15 01:02:11,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-15 01:02:11,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-15 01:02:11,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-15 01:02:11,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 01:02:11,804 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 01:02:11,804 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 01:02:11,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 01:02:11,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 01:02:11,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 01:02:11,805 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-15 01:02:11,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 01:02:11,806 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2024-10-15 01:02:11,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2024-10-15 01:02:11,806 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 01:02:11,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 01:02:11,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-15 01:02:11,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-15 01:02:11,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-15 01:02:11,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 01:02:11,806 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 01:02:11,806 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 01:02:11,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 01:02:11,807 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 01:02:11,807 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 01:02:11,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-15 01:02:11,807 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 01:02:11,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-15 01:02:11,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.10 01:02:11 BoogieIcfgContainer [2024-10-15 01:02:11,816 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-15 01:02:11,816 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 01:02:11,817 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 01:02:11,817 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 01:02:11,817 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:02:05" (3/4) ... [2024-10-15 01:02:11,819 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-15 01:02:11,820 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 01:02:11,821 INFO L158 Benchmark]: Toolchain (without parser) took 8445.94ms. Allocated memory was 157.3MB in the beginning and 274.7MB in the end (delta: 117.4MB). Free memory was 119.7MB in the beginning and 130.5MB in the end (delta: -10.9MB). Peak memory consumption was 105.1MB. Max. memory is 16.1GB. [2024-10-15 01:02:11,823 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 107.0MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 01:02:11,823 INFO L158 Benchmark]: CACSL2BoogieTranslator took 545.57ms. Allocated memory is still 157.3MB. Free memory was 119.0MB in the beginning and 94.4MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-15 01:02:11,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.25ms. Allocated memory is still 157.3MB. Free memory was 94.4MB in the beginning and 89.1MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-15 01:02:11,824 INFO L158 Benchmark]: Boogie Preprocessor took 94.95ms. Allocated memory is still 157.3MB. Free memory was 89.1MB in the beginning and 82.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-15 01:02:11,824 INFO L158 Benchmark]: RCFGBuilder took 1288.86ms. Allocated memory is still 157.3MB. Free memory was 82.8MB in the beginning and 53.6MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-15 01:02:11,825 INFO L158 Benchmark]: BuchiAutomizer took 6410.38ms. Allocated memory was 157.3MB in the beginning and 274.7MB in the end (delta: 117.4MB). Free memory was 53.6MB in the beginning and 130.5MB in the end (delta: -77.0MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2024-10-15 01:02:11,825 INFO L158 Benchmark]: Witness Printer took 3.95ms. Allocated memory is still 274.7MB. Free memory is still 130.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 01:02:11,830 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.08ms. Allocated memory is still 107.0MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 545.57ms. Allocated memory is still 157.3MB. Free memory was 119.0MB in the beginning and 94.4MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.25ms. Allocated memory is still 157.3MB. Free memory was 94.4MB in the beginning and 89.1MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.95ms. Allocated memory is still 157.3MB. Free memory was 89.1MB in the beginning and 82.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1288.86ms. Allocated memory is still 157.3MB. Free memory was 82.8MB in the beginning and 53.6MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 6410.38ms. Allocated memory was 157.3MB in the beginning and 274.7MB in the end (delta: 117.4MB). Free memory was 53.6MB in the beginning and 130.5MB in the end (delta: -77.0MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. * Witness Printer took 3.95ms. Allocated memory is still 274.7MB. Free memory is still 130.5MB. 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 6.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 5.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. 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, 576 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 575 mSDsluCounter, 3586 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2103 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40 IncrementalHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 1483 mSDtfsCounter, 40 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital205 mio100 ax100 hnf100 lsp36 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: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-15 01:02:11,855 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-15 01:02:12,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE