./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/locks/test_locks_11.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 dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 22:45:36,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 22:45:36,090 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-10 22:45:36,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 22:45:36,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 22:45:36,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 22:45:36,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 22:45:36,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 22:45:36,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 22:45:36,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 22:45:36,118 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 22:45:36,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 22:45:36,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 22:45:36,119 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 22:45:36,119 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 22:45:36,120 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 22:45:36,120 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 22:45:36,120 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 22:45:36,120 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 22:45:36,120 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 22:45:36,121 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 22:45:36,121 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 22:45:36,121 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 22:45:36,121 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 22:45:36,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 22:45:36,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 22:45:36,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 22:45:36,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 22:45:36,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 22:45:36,122 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 22:45:36,123 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 22:45:36,123 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 22:45:36,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 22:45:36,123 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 22:45:36,123 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 22:45:36,123 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 22:45:36,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 22:45:36,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 22:45:36,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 22:45:36,127 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 22:45:36,127 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 -> dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 [2024-11-10 22:45:36,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 22:45:36,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 22:45:36,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 22:45:36,375 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 22:45:36,375 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 22:45:36,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_11.c [2024-11-10 22:45:37,525 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 22:45:37,686 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 22:45:37,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2024-11-10 22:45:37,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2143a80d/3306757c023b467c8f30df136f07e2bb/FLAG12bc76471 [2024-11-10 22:45:38,099 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2143a80d/3306757c023b467c8f30df136f07e2bb [2024-11-10 22:45:38,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 22:45:38,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 22:45:38,103 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 22:45:38,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 22:45:38,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 22:45:38,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70b52fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38, skipping insertion in model container [2024-11-10 22:45:38,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,131 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 22:45:38,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:45:38,279 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 22:45:38,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:45:38,308 INFO L204 MainTranslator]: Completed translation [2024-11-10 22:45:38,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38 WrapperNode [2024-11-10 22:45:38,308 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 22:45:38,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 22:45:38,309 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 22:45:38,309 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 22:45:38,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,319 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,332 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 148 [2024-11-10 22:45:38,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 22:45:38,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 22:45:38,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 22:45:38,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 22:45:38,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,341 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,348 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-11-10 22:45:38,349 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,351 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,352 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,353 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 22:45:38,355 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 22:45:38,355 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 22:45:38,355 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 22:45:38,355 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:38,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:38,384 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-11-10 22:45:38,386 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-11-10 22:45:38,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 22:45:38,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 22:45:38,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 22:45:38,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 22:45:38,473 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 22:45:38,474 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 22:45:38,659 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-10 22:45:38,659 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 22:45:38,669 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 22:45:38,670 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 22:45:38,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:45:38 BoogieIcfgContainer [2024-11-10 22:45:38,670 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 22:45:38,671 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 22:45:38,671 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 22:45:38,673 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 22:45:38,674 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:45:38,674 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:45:38" (1/3) ... [2024-11-10 22:45:38,675 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37befbe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:45:38, skipping insertion in model container [2024-11-10 22:45:38,675 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:45:38,675 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38" (2/3) ... [2024-11-10 22:45:38,675 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37befbe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:45:38, skipping insertion in model container [2024-11-10 22:45:38,675 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:45:38,675 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:45:38" (3/3) ... [2024-11-10 22:45:38,676 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_11.c [2024-11-10 22:45:38,711 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 22:45:38,711 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 22:45:38,711 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 22:45:38,712 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 22:45:38,712 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 22:45:38,712 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 22:45:38,712 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 22:45:38,712 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 22:45:38,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 44 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 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-11-10 22:45:38,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2024-11-10 22:45:38,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:38,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:38,732 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:38,732 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] [2024-11-10 22:45:38,732 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 22:45:38,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 44 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 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-11-10 22:45:38,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2024-11-10 22:45:38,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:38,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:38,735 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:38,735 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] [2024-11-10 22:45:38,741 INFO L745 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue 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(16, 2);call #Ultimate.allocInit(12, 3); 40#ULTIMATE.init_returnLabel#1true assume true;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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 6#L44true [2024-11-10 22:45:38,742 INFO L747 eck$LassoCheckResult]: Loop: 6#L44true assume true; 10#L44-1true assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 21#L46true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 43#L73true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 14#L77true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 36#L81true assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; 8#L85true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 7#L89true assume !(0 != main_~p5~0#1); 4#L93true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 9#L97true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 32#L101true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 26#L105true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 15#L109true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 17#L113true assume 0 != main_~p11~0#1;main_~lk11~0#1 := 1; 30#L119true assume !(0 != main_~p1~0#1); 23#L124true assume !(0 != main_~p2~0#1); 18#L129true assume !(0 != main_~p3~0#1); 33#L134true assume !(0 != main_~p4~0#1); 42#L139true assume !(0 != main_~p5~0#1); 11#L144true assume !(0 != main_~p6~0#1); 38#L149true assume !(0 != main_~p7~0#1); 37#L154true assume !(0 != main_~p8~0#1); 12#L159true assume !(0 != main_~p9~0#1); 27#L164true assume !(0 != main_~p10~0#1); 39#L169true assume !(0 != main_~p11~0#1); 6#L44true [2024-11-10 22:45:38,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:38,746 INFO L85 PathProgramCache]: Analyzing trace with hash 4704, now seen corresponding path program 1 times [2024-11-10 22:45:38,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:38,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771704531] [2024-11-10 22:45:38,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:38,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:38,824 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:38,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:38,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:38,851 INFO L85 PathProgramCache]: Analyzing trace with hash 270354046, now seen corresponding path program 1 times [2024-11-10 22:45:38,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:38,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654051784] [2024-11-10 22:45:38,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:38,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:38,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:45:38,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:38,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654051784] [2024-11-10 22:45:38,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654051784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:38,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:38,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:38,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343332484] [2024-11-10 22:45:38,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:38,959 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:38,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:38,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:38,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:38,985 INFO L87 Difference]: Start difference. First operand has 44 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 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 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-11-10 22:45:39,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:39,018 INFO L93 Difference]: Finished difference Result 81 states and 143 transitions. [2024-11-10 22:45:39,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 143 transitions. [2024-11-10 22:45:39,023 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 71 [2024-11-10 22:45:39,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 73 states and 115 transitions. [2024-11-10 22:45:39,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2024-11-10 22:45:39,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2024-11-10 22:45:39,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 115 transitions. [2024-11-10 22:45:39,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:39,028 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73 states and 115 transitions. [2024-11-10 22:45:39,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 115 transitions. [2024-11-10 22:45:39,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-10 22:45:39,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.5753424657534247) internal successors, (115), 72 states have internal predecessors, (115), 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-11-10 22:45:39,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 115 transitions. [2024-11-10 22:45:39,050 INFO L240 hiAutomatonCegarLoop]: Abstraction has 73 states and 115 transitions. [2024-11-10 22:45:39,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:39,053 INFO L425 stractBuchiCegarLoop]: Abstraction has 73 states and 115 transitions. [2024-11-10 22:45:39,053 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 22:45:39,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 115 transitions. [2024-11-10 22:45:39,054 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 71 [2024-11-10 22:45:39,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:39,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:39,055 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:39,055 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] [2024-11-10 22:45:39,055 INFO L745 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY 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(16, 2);call #Ultimate.allocInit(12, 3); 173#ULTIMATE.init_returnLabel#1 assume true;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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 138#L44 [2024-11-10 22:45:39,055 INFO L747 eck$LassoCheckResult]: Loop: 138#L44 assume true; 139#L44-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 162#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 163#L73 assume !(0 != main_~p1~0#1); 187#L77 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 186#L81 assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; 185#L85 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 184#L89 assume !(0 != main_~p5~0#1); 183#L93 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 182#L97 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 175#L101 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 176#L105 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 153#L109 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 154#L113 assume 0 != main_~p11~0#1;main_~lk11~0#1 := 1; 155#L119 assume !(0 != main_~p1~0#1); 180#L124 assume !(0 != main_~p2~0#1); 205#L129 assume !(0 != main_~p3~0#1); 177#L134 assume !(0 != main_~p4~0#1); 161#L139 assume !(0 != main_~p5~0#1); 145#L144 assume !(0 != main_~p6~0#1); 147#L149 assume !(0 != main_~p7~0#1); 150#L154 assume !(0 != main_~p8~0#1); 148#L159 assume !(0 != main_~p9~0#1); 135#L164 assume !(0 != main_~p10~0#1); 168#L169 assume !(0 != main_~p11~0#1); 138#L44 [2024-11-10 22:45:39,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:39,056 INFO L85 PathProgramCache]: Analyzing trace with hash 4704, now seen corresponding path program 2 times [2024-11-10 22:45:39,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:39,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599886167] [2024-11-10 22:45:39,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:39,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:39,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:39,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:39,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:39,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1767702243, now seen corresponding path program 1 times [2024-11-10 22:45:39,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:39,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953567421] [2024-11-10 22:45:39,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:39,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:39,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:45:39,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:39,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953567421] [2024-11-10 22:45:39,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953567421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:39,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:39,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:39,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418368309] [2024-11-10 22:45:39,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:39,125 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:39,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:39,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:39,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:39,127 INFO L87 Difference]: Start difference. First operand 73 states and 115 transitions. cyclomatic complexity: 44 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-11-10 22:45:39,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:39,150 INFO L93 Difference]: Finished difference Result 142 states and 222 transitions. [2024-11-10 22:45:39,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 222 transitions. [2024-11-10 22:45:39,155 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 140 [2024-11-10 22:45:39,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 142 states and 222 transitions. [2024-11-10 22:45:39,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 142 [2024-11-10 22:45:39,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 142 [2024-11-10 22:45:39,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 222 transitions. [2024-11-10 22:45:39,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:39,160 INFO L218 hiAutomatonCegarLoop]: Abstraction has 142 states and 222 transitions. [2024-11-10 22:45:39,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 222 transitions. [2024-11-10 22:45:39,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-10 22:45:39,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 142 states have (on average 1.5633802816901408) internal successors, (222), 141 states have internal predecessors, (222), 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-11-10 22:45:39,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 222 transitions. [2024-11-10 22:45:39,170 INFO L240 hiAutomatonCegarLoop]: Abstraction has 142 states and 222 transitions. [2024-11-10 22:45:39,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:39,171 INFO L425 stractBuchiCegarLoop]: Abstraction has 142 states and 222 transitions. [2024-11-10 22:45:39,171 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 22:45:39,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 222 transitions. [2024-11-10 22:45:39,173 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 140 [2024-11-10 22:45:39,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:39,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:39,174 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:39,174 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] [2024-11-10 22:45:39,174 INFO L745 eck$LassoCheckResult]: Stem: 395#ULTIMATE.startENTRY 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(16, 2);call #Ultimate.allocInit(12, 3); 396#ULTIMATE.init_returnLabel#1 assume true;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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 401#L44 [2024-11-10 22:45:39,174 INFO L747 eck$LassoCheckResult]: Loop: 401#L44 assume true; 408#L44-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 407#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 405#L73 assume !(0 != main_~p1~0#1); 406#L77 assume !(0 != main_~p2~0#1); 438#L81 assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; 437#L85 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 436#L89 assume !(0 != main_~p5~0#1); 435#L93 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 434#L97 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 433#L101 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 432#L105 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 431#L109 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 430#L113 assume 0 != main_~p11~0#1;main_~lk11~0#1 := 1; 429#L119 assume !(0 != main_~p1~0#1); 427#L124 assume !(0 != main_~p2~0#1); 426#L129 assume !(0 != main_~p3~0#1); 424#L134 assume !(0 != main_~p4~0#1); 422#L139 assume !(0 != main_~p5~0#1); 420#L144 assume !(0 != main_~p6~0#1); 418#L149 assume !(0 != main_~p7~0#1); 415#L154 assume !(0 != main_~p8~0#1); 414#L159 assume !(0 != main_~p9~0#1); 412#L164 assume !(0 != main_~p10~0#1); 410#L169 assume !(0 != main_~p11~0#1); 401#L44 [2024-11-10 22:45:39,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:39,175 INFO L85 PathProgramCache]: Analyzing trace with hash 4704, now seen corresponding path program 3 times [2024-11-10 22:45:39,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:39,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730428912] [2024-11-10 22:45:39,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:39,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:39,182 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:39,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:39,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:39,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1556351330, now seen corresponding path program 1 times [2024-11-10 22:45:39,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:39,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126206142] [2024-11-10 22:45:39,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:39,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:39,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:45:39,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:39,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126206142] [2024-11-10 22:45:39,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126206142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:39,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:39,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:39,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228355406] [2024-11-10 22:45:39,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:39,249 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:39,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:39,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:39,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:39,250 INFO L87 Difference]: Start difference. First operand 142 states and 222 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-11-10 22:45:39,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:39,265 INFO L93 Difference]: Finished difference Result 278 states and 430 transitions. [2024-11-10 22:45:39,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 278 states and 430 transitions. [2024-11-10 22:45:39,268 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 276 [2024-11-10 22:45:39,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 278 states to 278 states and 430 transitions. [2024-11-10 22:45:39,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 278 [2024-11-10 22:45:39,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 278 [2024-11-10 22:45:39,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 278 states and 430 transitions. [2024-11-10 22:45:39,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:39,272 INFO L218 hiAutomatonCegarLoop]: Abstraction has 278 states and 430 transitions. [2024-11-10 22:45:39,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states and 430 transitions. [2024-11-10 22:45:39,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2024-11-10 22:45:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 278 states have (on average 1.5467625899280575) internal successors, (430), 277 states have internal predecessors, (430), 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-11-10 22:45:39,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 430 transitions. [2024-11-10 22:45:39,285 INFO L240 hiAutomatonCegarLoop]: Abstraction has 278 states and 430 transitions. [2024-11-10 22:45:39,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:39,286 INFO L425 stractBuchiCegarLoop]: Abstraction has 278 states and 430 transitions. [2024-11-10 22:45:39,286 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 22:45:39,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 278 states and 430 transitions. [2024-11-10 22:45:39,288 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 276 [2024-11-10 22:45:39,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:39,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:39,288 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:39,288 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] [2024-11-10 22:45:39,288 INFO L745 eck$LassoCheckResult]: Stem: 819#ULTIMATE.startENTRY 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(16, 2);call #Ultimate.allocInit(12, 3); 820#ULTIMATE.init_returnLabel#1 assume true;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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 827#L44 [2024-11-10 22:45:39,288 INFO L747 eck$LassoCheckResult]: Loop: 827#L44 assume true; 847#L44-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 839#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 840#L73 assume !(0 != main_~p1~0#1); 949#L77 assume !(0 != main_~p2~0#1); 946#L81 assume !(0 != main_~p3~0#1); 942#L85 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 938#L89 assume !(0 != main_~p5~0#1); 934#L93 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 930#L97 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 926#L101 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 922#L105 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 918#L109 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 914#L113 assume 0 != main_~p11~0#1;main_~lk11~0#1 := 1; 910#L119 assume !(0 != main_~p1~0#1); 906#L124 assume !(0 != main_~p2~0#1); 903#L129 assume !(0 != main_~p3~0#1); 904#L134 assume !(0 != main_~p4~0#1); 885#L139 assume !(0 != main_~p5~0#1); 884#L144 assume !(0 != main_~p6~0#1); 961#L149 assume !(0 != main_~p7~0#1); 866#L154 assume !(0 != main_~p8~0#1); 868#L159 assume !(0 != main_~p9~0#1); 856#L164 assume !(0 != main_~p10~0#1); 852#L169 assume !(0 != main_~p11~0#1); 827#L44 [2024-11-10 22:45:39,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:39,289 INFO L85 PathProgramCache]: Analyzing trace with hash 4704, now seen corresponding path program 4 times [2024-11-10 22:45:39,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:39,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273764204] [2024-11-10 22:45:39,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:39,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:39,296 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:39,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:39,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:39,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1965175555, now seen corresponding path program 1 times [2024-11-10 22:45:39,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:39,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540909189] [2024-11-10 22:45:39,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:39,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:39,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:45:39,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:39,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540909189] [2024-11-10 22:45:39,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540909189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:39,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:39,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:39,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086256438] [2024-11-10 22:45:39,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:39,343 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:39,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:39,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:39,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:39,343 INFO L87 Difference]: Start difference. First operand 278 states and 430 transitions. cyclomatic complexity: 160 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-11-10 22:45:39,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:39,362 INFO L93 Difference]: Finished difference Result 546 states and 834 transitions. [2024-11-10 22:45:39,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 546 states and 834 transitions. [2024-11-10 22:45:39,366 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 544 [2024-11-10 22:45:39,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 546 states to 546 states and 834 transitions. [2024-11-10 22:45:39,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 546 [2024-11-10 22:45:39,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 546 [2024-11-10 22:45:39,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 546 states and 834 transitions. [2024-11-10 22:45:39,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:39,372 INFO L218 hiAutomatonCegarLoop]: Abstraction has 546 states and 834 transitions. [2024-11-10 22:45:39,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states and 834 transitions. [2024-11-10 22:45:39,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2024-11-10 22:45:39,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 546 states have (on average 1.5274725274725274) internal successors, (834), 545 states have internal predecessors, (834), 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-11-10 22:45:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 834 transitions. [2024-11-10 22:45:39,393 INFO L240 hiAutomatonCegarLoop]: Abstraction has 546 states and 834 transitions. [2024-11-10 22:45:39,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:39,394 INFO L425 stractBuchiCegarLoop]: Abstraction has 546 states and 834 transitions. [2024-11-10 22:45:39,394 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-10 22:45:39,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 546 states and 834 transitions. [2024-11-10 22:45:39,397 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 544 [2024-11-10 22:45:39,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:39,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:39,398 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:39,398 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] [2024-11-10 22:45:39,398 INFO L745 eck$LassoCheckResult]: Stem: 1645#ULTIMATE.startENTRY 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(16, 2);call #Ultimate.allocInit(12, 3); 1646#ULTIMATE.init_returnLabel#1 assume true;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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 1652#L44 [2024-11-10 22:45:39,398 INFO L747 eck$LassoCheckResult]: Loop: 1652#L44 assume true; 1799#L44-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 1797#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 1794#L73 assume !(0 != main_~p1~0#1); 1795#L77 assume !(0 != main_~p2~0#1); 1780#L81 assume !(0 != main_~p3~0#1); 1782#L85 assume !(0 != main_~p4~0#1); 1768#L89 assume !(0 != main_~p5~0#1); 1769#L93 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1756#L97 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1757#L101 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1743#L105 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1744#L109 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1730#L113 assume 0 != main_~p11~0#1;main_~lk11~0#1 := 1; 1731#L119 assume !(0 != main_~p1~0#1); 1833#L124 assume !(0 != main_~p2~0#1); 1831#L129 assume !(0 != main_~p3~0#1); 1829#L134 assume !(0 != main_~p4~0#1); 1826#L139 assume !(0 != main_~p5~0#1); 1822#L144 assume !(0 != main_~p6~0#1); 1818#L149 assume !(0 != main_~p7~0#1); 1813#L154 assume !(0 != main_~p8~0#1); 1812#L159 assume !(0 != main_~p9~0#1); 1808#L164 assume !(0 != main_~p10~0#1); 1804#L169 assume !(0 != main_~p11~0#1); 1652#L44 [2024-11-10 22:45:39,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:39,398 INFO L85 PathProgramCache]: Analyzing trace with hash 4704, now seen corresponding path program 5 times [2024-11-10 22:45:39,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:39,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024623667] [2024-11-10 22:45:39,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:39,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:39,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:39,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:39,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:39,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1485319870, now seen corresponding path program 1 times [2024-11-10 22:45:39,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:39,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516770128] [2024-11-10 22:45:39,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:39,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:39,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:45:39,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:39,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516770128] [2024-11-10 22:45:39,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516770128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:39,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:39,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:39,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559023754] [2024-11-10 22:45:39,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:39,439 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:39,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:39,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:39,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:39,439 INFO L87 Difference]: Start difference. First operand 546 states and 834 transitions. cyclomatic complexity: 304 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-11-10 22:45:39,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:39,456 INFO L93 Difference]: Finished difference Result 1074 states and 1618 transitions. [2024-11-10 22:45:39,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1074 states and 1618 transitions. [2024-11-10 22:45:39,461 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1072 [2024-11-10 22:45:39,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1074 states to 1074 states and 1618 transitions. [2024-11-10 22:45:39,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1074 [2024-11-10 22:45:39,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1074 [2024-11-10 22:45:39,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1074 states and 1618 transitions. [2024-11-10 22:45:39,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:39,467 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1074 states and 1618 transitions. [2024-11-10 22:45:39,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states and 1618 transitions. [2024-11-10 22:45:39,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1074. [2024-11-10 22:45:39,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 1074 states have (on average 1.5065176908752327) internal successors, (1618), 1073 states have internal predecessors, (1618), 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-11-10 22:45:39,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1618 transitions. [2024-11-10 22:45:39,488 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1074 states and 1618 transitions. [2024-11-10 22:45:39,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:39,491 INFO L425 stractBuchiCegarLoop]: Abstraction has 1074 states and 1618 transitions. [2024-11-10 22:45:39,491 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-10 22:45:39,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1074 states and 1618 transitions. [2024-11-10 22:45:39,495 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1072 [2024-11-10 22:45:39,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:39,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:39,496 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:39,496 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] [2024-11-10 22:45:39,496 INFO L745 eck$LassoCheckResult]: Stem: 3273#ULTIMATE.startENTRY 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(16, 2);call #Ultimate.allocInit(12, 3); 3274#ULTIMATE.init_returnLabel#1 assume true;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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 3287#L44 [2024-11-10 22:45:39,496 INFO L747 eck$LassoCheckResult]: Loop: 3287#L44 assume true; 3348#L44-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 3346#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 3344#L73 assume !(0 != main_~p1~0#1); 3340#L77 assume !(0 != main_~p2~0#1); 3336#L81 assume !(0 != main_~p3~0#1); 3332#L85 assume !(0 != main_~p4~0#1); 3330#L89 assume !(0 != main_~p5~0#1); 3326#L93 assume !(0 != main_~p6~0#1); 3324#L97 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3322#L101 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3320#L105 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3318#L109 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3316#L113 assume 0 != main_~p11~0#1;main_~lk11~0#1 := 1; 3313#L119 assume !(0 != main_~p1~0#1); 3314#L124 assume !(0 != main_~p2~0#1); 3383#L129 assume !(0 != main_~p3~0#1); 3379#L134 assume !(0 != main_~p4~0#1); 3376#L139 assume !(0 != main_~p5~0#1); 3371#L144 assume !(0 != main_~p6~0#1); 3368#L149 assume !(0 != main_~p7~0#1); 3363#L154 assume !(0 != main_~p8~0#1); 3360#L159 assume !(0 != main_~p9~0#1); 3356#L164 assume !(0 != main_~p10~0#1); 3352#L169 assume !(0 != main_~p11~0#1); 3287#L44 [2024-11-10 22:45:39,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:39,497 INFO L85 PathProgramCache]: Analyzing trace with hash 4704, now seen corresponding path program 6 times [2024-11-10 22:45:39,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:39,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254249863] [2024-11-10 22:45:39,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:39,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:39,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:39,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:39,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:39,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1456337729, now seen corresponding path program 1 times [2024-11-10 22:45:39,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:39,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171361544] [2024-11-10 22:45:39,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:39,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:39,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-11-10 22:45:39,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:39,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171361544] [2024-11-10 22:45:39,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171361544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:39,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:39,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:39,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557666846] [2024-11-10 22:45:39,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:39,540 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:39,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:39,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:39,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:39,540 INFO L87 Difference]: Start difference. First operand 1074 states and 1618 transitions. cyclomatic complexity: 576 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-11-10 22:45:39,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:39,562 INFO L93 Difference]: Finished difference Result 2114 states and 3138 transitions. [2024-11-10 22:45:39,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2114 states and 3138 transitions. [2024-11-10 22:45:39,575 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2112 [2024-11-10 22:45:39,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2114 states to 2114 states and 3138 transitions. [2024-11-10 22:45:39,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2114 [2024-11-10 22:45:39,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2114 [2024-11-10 22:45:39,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2114 states and 3138 transitions. [2024-11-10 22:45:39,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:39,597 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2114 states and 3138 transitions. [2024-11-10 22:45:39,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states and 3138 transitions. [2024-11-10 22:45:39,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2114. [2024-11-10 22:45:39,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2114 states, 2114 states have (on average 1.4843897824030274) internal successors, (3138), 2113 states have internal predecessors, (3138), 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-11-10 22:45:39,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 3138 transitions. [2024-11-10 22:45:39,622 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2114 states and 3138 transitions. [2024-11-10 22:45:39,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:39,623 INFO L425 stractBuchiCegarLoop]: Abstraction has 2114 states and 3138 transitions. [2024-11-10 22:45:39,623 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-10 22:45:39,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2114 states and 3138 transitions. [2024-11-10 22:45:39,629 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2112 [2024-11-10 22:45:39,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:39,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:39,629 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:39,629 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] [2024-11-10 22:45:39,630 INFO L745 eck$LassoCheckResult]: Stem: 6469#ULTIMATE.startENTRY 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(16, 2);call #Ultimate.allocInit(12, 3); 6470#ULTIMATE.init_returnLabel#1 assume true;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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 6481#L44 [2024-11-10 22:45:39,630 INFO L747 eck$LassoCheckResult]: Loop: 6481#L44 assume true; 6618#L44-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 6602#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 6603#L73 assume !(0 != main_~p1~0#1); 6586#L77 assume !(0 != main_~p2~0#1); 6588#L81 assume !(0 != main_~p3~0#1); 6562#L85 assume !(0 != main_~p4~0#1); 6564#L89 assume !(0 != main_~p5~0#1); 6542#L93 assume !(0 != main_~p6~0#1); 6544#L97 assume !(0 != main_~p7~0#1); 6681#L101 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 6680#L105 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 6679#L109 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 6678#L113 assume 0 != main_~p11~0#1;main_~lk11~0#1 := 1; 6676#L119 assume !(0 != main_~p1~0#1); 6674#L124 assume !(0 != main_~p2~0#1); 6671#L129 assume !(0 != main_~p3~0#1); 6667#L134 assume !(0 != main_~p4~0#1); 6664#L139 assume !(0 != main_~p5~0#1); 6659#L144 assume !(0 != main_~p6~0#1); 6657#L149 assume !(0 != main_~p7~0#1); 6649#L154 assume !(0 != main_~p8~0#1); 6651#L159 assume !(0 != main_~p9~0#1); 6645#L164 assume !(0 != main_~p10~0#1); 6644#L169 assume !(0 != main_~p11~0#1); 6481#L44 [2024-11-10 22:45:39,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:39,630 INFO L85 PathProgramCache]: Analyzing trace with hash 4704, now seen corresponding path program 7 times [2024-11-10 22:45:39,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:39,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045029196] [2024-11-10 22:45:39,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:39,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:39,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:39,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:39,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:39,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1966871906, now seen corresponding path program 1 times [2024-11-10 22:45:39,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:39,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230800404] [2024-11-10 22:45:39,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:39,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:39,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:45:39,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:39,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230800404] [2024-11-10 22:45:39,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230800404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:39,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:39,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:39,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938017899] [2024-11-10 22:45:39,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:39,668 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:39,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:39,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:39,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:39,670 INFO L87 Difference]: Start difference. First operand 2114 states and 3138 transitions. cyclomatic complexity: 1088 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-11-10 22:45:39,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:39,696 INFO L93 Difference]: Finished difference Result 4162 states and 6082 transitions. [2024-11-10 22:45:39,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4162 states and 6082 transitions. [2024-11-10 22:45:39,715 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4160 [2024-11-10 22:45:39,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4162 states to 4162 states and 6082 transitions. [2024-11-10 22:45:39,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4162 [2024-11-10 22:45:39,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4162 [2024-11-10 22:45:39,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4162 states and 6082 transitions. [2024-11-10 22:45:39,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:39,736 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4162 states and 6082 transitions. [2024-11-10 22:45:39,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4162 states and 6082 transitions. [2024-11-10 22:45:39,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4162 to 4162. [2024-11-10 22:45:39,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4162 states, 4162 states have (on average 1.4613166746756368) internal successors, (6082), 4161 states have internal predecessors, (6082), 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-11-10 22:45:39,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4162 states to 4162 states and 6082 transitions. [2024-11-10 22:45:39,782 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4162 states and 6082 transitions. [2024-11-10 22:45:39,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:39,783 INFO L425 stractBuchiCegarLoop]: Abstraction has 4162 states and 6082 transitions. [2024-11-10 22:45:39,783 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-10 22:45:39,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4162 states and 6082 transitions. [2024-11-10 22:45:39,794 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4160 [2024-11-10 22:45:39,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:39,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:39,794 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:39,794 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] [2024-11-10 22:45:39,794 INFO L745 eck$LassoCheckResult]: Stem: 12752#ULTIMATE.startENTRY 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(16, 2);call #Ultimate.allocInit(12, 3); 12753#ULTIMATE.init_returnLabel#1 assume true;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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 12762#L44 [2024-11-10 22:45:39,794 INFO L747 eck$LassoCheckResult]: Loop: 12762#L44 assume true; 12874#L44-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 12872#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 12868#L73 assume !(0 != main_~p1~0#1); 12864#L77 assume !(0 != main_~p2~0#1); 12862#L81 assume !(0 != main_~p3~0#1); 12858#L85 assume !(0 != main_~p4~0#1); 12856#L89 assume !(0 != main_~p5~0#1); 12852#L93 assume !(0 != main_~p6~0#1); 12848#L97 assume !(0 != main_~p7~0#1); 12844#L101 assume !(0 != main_~p8~0#1); 12842#L105 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 12840#L109 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 12838#L113 assume 0 != main_~p11~0#1;main_~lk11~0#1 := 1; 12834#L119 assume !(0 != main_~p1~0#1); 12830#L124 assume !(0 != main_~p2~0#1); 12827#L129 assume !(0 != main_~p3~0#1); 12828#L134 assume !(0 != main_~p4~0#1); 12902#L139 assume !(0 != main_~p5~0#1); 12897#L144 assume !(0 != main_~p6~0#1); 12893#L149 assume !(0 != main_~p7~0#1); 12889#L154 assume !(0 != main_~p8~0#1); 12886#L159 assume !(0 != main_~p9~0#1); 12882#L164 assume !(0 != main_~p10~0#1); 12878#L169 assume !(0 != main_~p11~0#1); 12762#L44 [2024-11-10 22:45:39,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:39,795 INFO L85 PathProgramCache]: Analyzing trace with hash 4704, now seen corresponding path program 8 times [2024-11-10 22:45:39,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:39,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841258766] [2024-11-10 22:45:39,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:39,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:39,800 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:39,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:39,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:39,804 INFO L85 PathProgramCache]: Analyzing trace with hash -459320097, now seen corresponding path program 1 times [2024-11-10 22:45:39,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:39,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899197250] [2024-11-10 22:45:39,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:39,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:39,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:45:39,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:39,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899197250] [2024-11-10 22:45:39,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899197250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:39,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:39,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:39,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895984742] [2024-11-10 22:45:39,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:39,825 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:39,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:39,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:39,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:39,826 INFO L87 Difference]: Start difference. First operand 4162 states and 6082 transitions. cyclomatic complexity: 2048 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-11-10 22:45:39,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:39,859 INFO L93 Difference]: Finished difference Result 8194 states and 11778 transitions. [2024-11-10 22:45:39,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8194 states and 11778 transitions. [2024-11-10 22:45:39,917 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8192 [2024-11-10 22:45:39,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8194 states to 8194 states and 11778 transitions. [2024-11-10 22:45:39,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8194 [2024-11-10 22:45:39,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8194 [2024-11-10 22:45:39,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8194 states and 11778 transitions. [2024-11-10 22:45:39,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:39,953 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8194 states and 11778 transitions. [2024-11-10 22:45:39,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8194 states and 11778 transitions. [2024-11-10 22:45:40,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8194 to 8194. [2024-11-10 22:45:40,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8194 states, 8194 states have (on average 1.4373932145472297) internal successors, (11778), 8193 states have internal predecessors, (11778), 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-11-10 22:45:40,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8194 states to 8194 states and 11778 transitions. [2024-11-10 22:45:40,059 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8194 states and 11778 transitions. [2024-11-10 22:45:40,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:40,060 INFO L425 stractBuchiCegarLoop]: Abstraction has 8194 states and 11778 transitions. [2024-11-10 22:45:40,060 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-10 22:45:40,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8194 states and 11778 transitions. [2024-11-10 22:45:40,078 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8192 [2024-11-10 22:45:40,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:40,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:40,080 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:40,080 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] [2024-11-10 22:45:40,080 INFO L745 eck$LassoCheckResult]: Stem: 25114#ULTIMATE.startENTRY 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(16, 2);call #Ultimate.allocInit(12, 3); 25115#ULTIMATE.init_returnLabel#1 assume true;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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 25125#L44 [2024-11-10 22:45:40,080 INFO L747 eck$LassoCheckResult]: Loop: 25125#L44 assume true; 25512#L44-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 25502#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 25503#L73 assume !(0 != main_~p1~0#1); 25488#L77 assume !(0 != main_~p2~0#1); 25490#L81 assume !(0 != main_~p3~0#1); 25603#L85 assume !(0 != main_~p4~0#1); 25600#L89 assume !(0 != main_~p5~0#1); 25597#L93 assume !(0 != main_~p6~0#1); 25593#L97 assume !(0 != main_~p7~0#1); 25590#L101 assume !(0 != main_~p8~0#1); 25582#L105 assume !(0 != main_~p9~0#1); 25583#L109 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 25578#L113 assume 0 != main_~p11~0#1;main_~lk11~0#1 := 1; 25579#L119 assume !(0 != main_~p1~0#1); 25399#L124 assume !(0 != main_~p2~0#1); 25401#L129 assume !(0 != main_~p3~0#1); 25333#L134 assume !(0 != main_~p4~0#1); 25335#L139 assume !(0 != main_~p5~0#1); 25617#L144 assume !(0 != main_~p6~0#1); 25615#L149 assume !(0 != main_~p7~0#1); 25614#L154 assume !(0 != main_~p8~0#1); 25613#L159 assume !(0 != main_~p9~0#1); 25529#L164 assume !(0 != main_~p10~0#1); 25528#L169 assume !(0 != main_~p11~0#1); 25125#L44 [2024-11-10 22:45:40,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:40,081 INFO L85 PathProgramCache]: Analyzing trace with hash 4704, now seen corresponding path program 9 times [2024-11-10 22:45:40,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:40,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044031431] [2024-11-10 22:45:40,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:40,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:40,086 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:40,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:40,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:40,091 INFO L85 PathProgramCache]: Analyzing trace with hash -964878722, now seen corresponding path program 1 times [2024-11-10 22:45:40,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:40,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370710071] [2024-11-10 22:45:40,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:40,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:40,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-11-10 22:45:40,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:40,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370710071] [2024-11-10 22:45:40,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370710071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:40,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:40,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:40,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713196858] [2024-11-10 22:45:40,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:40,114 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:40,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:40,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:40,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:40,115 INFO L87 Difference]: Start difference. First operand 8194 states and 11778 transitions. cyclomatic complexity: 3840 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-11-10 22:45:40,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:40,156 INFO L93 Difference]: Finished difference Result 16130 states and 22786 transitions. [2024-11-10 22:45:40,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16130 states and 22786 transitions. [2024-11-10 22:45:40,267 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 16128 [2024-11-10 22:45:40,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16130 states to 16130 states and 22786 transitions. [2024-11-10 22:45:40,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16130 [2024-11-10 22:45:40,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16130 [2024-11-10 22:45:40,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16130 states and 22786 transitions. [2024-11-10 22:45:40,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:40,314 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16130 states and 22786 transitions. [2024-11-10 22:45:40,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16130 states and 22786 transitions. [2024-11-10 22:45:40,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16130 to 16130. [2024-11-10 22:45:40,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16130 states, 16130 states have (on average 1.41264724116553) internal successors, (22786), 16129 states have internal predecessors, (22786), 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-11-10 22:45:40,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16130 states to 16130 states and 22786 transitions. [2024-11-10 22:45:40,515 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16130 states and 22786 transitions. [2024-11-10 22:45:40,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:40,517 INFO L425 stractBuchiCegarLoop]: Abstraction has 16130 states and 22786 transitions. [2024-11-10 22:45:40,517 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-10 22:45:40,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16130 states and 22786 transitions. [2024-11-10 22:45:40,596 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 16128 [2024-11-10 22:45:40,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:40,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:40,598 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:40,598 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] [2024-11-10 22:45:40,598 INFO L745 eck$LassoCheckResult]: Stem: 49442#ULTIMATE.startENTRY 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(16, 2);call #Ultimate.allocInit(12, 3); 49443#ULTIMATE.init_returnLabel#1 assume true;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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 49453#L44 [2024-11-10 22:45:40,599 INFO L747 eck$LassoCheckResult]: Loop: 49453#L44 assume true; 50033#L44-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 50022#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 50023#L73 assume !(0 != main_~p1~0#1); 50009#L77 assume !(0 != main_~p2~0#1); 50011#L81 assume !(0 != main_~p3~0#1); 49993#L85 assume !(0 != main_~p4~0#1); 49995#L89 assume !(0 != main_~p5~0#1); 49978#L93 assume !(0 != main_~p6~0#1); 49980#L97 assume !(0 != main_~p7~0#1); 50115#L101 assume !(0 != main_~p8~0#1); 50112#L105 assume !(0 != main_~p9~0#1); 50109#L109 assume !(0 != main_~p10~0#1); 50106#L113 assume 0 != main_~p11~0#1;main_~lk11~0#1 := 1; 50102#L119 assume !(0 != main_~p1~0#1); 50096#L124 assume !(0 != main_~p2~0#1); 50090#L129 assume !(0 != main_~p3~0#1); 50084#L134 assume !(0 != main_~p4~0#1); 50079#L139 assume !(0 != main_~p5~0#1); 49837#L144 assume !(0 != main_~p6~0#1); 49833#L149 assume !(0 != main_~p7~0#1); 49829#L154 assume !(0 != main_~p8~0#1); 49831#L159 assume !(0 != main_~p9~0#1); 50047#L164 assume !(0 != main_~p10~0#1); 50048#L169 assume !(0 != main_~p11~0#1); 49453#L44 [2024-11-10 22:45:40,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:40,599 INFO L85 PathProgramCache]: Analyzing trace with hash 4704, now seen corresponding path program 10 times [2024-11-10 22:45:40,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:40,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153055965] [2024-11-10 22:45:40,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:40,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:40,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:40,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:40,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:40,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1258281729, now seen corresponding path program 1 times [2024-11-10 22:45:40,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:40,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98670387] [2024-11-10 22:45:40,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:40,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:40,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:45:40,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:40,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98670387] [2024-11-10 22:45:40,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98670387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:40,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:40,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 22:45:40,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707082898] [2024-11-10 22:45:40,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:40,634 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:40,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:40,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:40,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:40,635 INFO L87 Difference]: Start difference. First operand 16130 states and 22786 transitions. cyclomatic complexity: 7168 Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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-11-10 22:45:40,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:40,775 INFO L93 Difference]: Finished difference Result 31746 states and 44034 transitions. [2024-11-10 22:45:40,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31746 states and 44034 transitions. [2024-11-10 22:45:40,959 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 31744 [2024-11-10 22:45:41,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31746 states to 31746 states and 44034 transitions. [2024-11-10 22:45:41,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31746 [2024-11-10 22:45:41,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31746 [2024-11-10 22:45:41,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31746 states and 44034 transitions. [2024-11-10 22:45:41,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:41,080 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31746 states and 44034 transitions. [2024-11-10 22:45:41,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31746 states and 44034 transitions. [2024-11-10 22:45:41,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31746 to 31746. [2024-11-10 22:45:41,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31746 states, 31746 states have (on average 1.3870723870723871) internal successors, (44034), 31745 states have internal predecessors, (44034), 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-11-10 22:45:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31746 states to 31746 states and 44034 transitions. [2024-11-10 22:45:41,488 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31746 states and 44034 transitions. [2024-11-10 22:45:41,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:41,489 INFO L425 stractBuchiCegarLoop]: Abstraction has 31746 states and 44034 transitions. [2024-11-10 22:45:41,489 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-10 22:45:41,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31746 states and 44034 transitions. [2024-11-10 22:45:41,562 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 31744 [2024-11-10 22:45:41,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:41,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:41,563 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:41,563 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] [2024-11-10 22:45:41,563 INFO L745 eck$LassoCheckResult]: Stem: 97327#ULTIMATE.startENTRY 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(16, 2);call #Ultimate.allocInit(12, 3); 97328#ULTIMATE.init_returnLabel#1 assume true;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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 97343#L44 [2024-11-10 22:45:41,563 INFO L747 eck$LassoCheckResult]: Loop: 97343#L44 assume true; 98085#L44-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 98083#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 98079#L73 assume !(0 != main_~p1~0#1); 98077#L77 assume !(0 != main_~p2~0#1); 97985#L81 assume !(0 != main_~p3~0#1); 97987#L85 assume !(0 != main_~p4~0#1); 97970#L89 assume !(0 != main_~p5~0#1); 97971#L93 assume !(0 != main_~p6~0#1); 98073#L97 assume !(0 != main_~p7~0#1); 98069#L101 assume !(0 != main_~p8~0#1); 98065#L105 assume !(0 != main_~p9~0#1); 98061#L109 assume !(0 != main_~p10~0#1); 98055#L113 assume !(0 != main_~p11~0#1); 98056#L119 assume !(0 != main_~p1~0#1); 98046#L124 assume !(0 != main_~p2~0#1); 98048#L129 assume !(0 != main_~p3~0#1); 98035#L134 assume !(0 != main_~p4~0#1); 98037#L139 assume !(0 != main_~p5~0#1); 97875#L144 assume !(0 != main_~p6~0#1); 97876#L149 assume !(0 != main_~p7~0#1); 97857#L154 assume !(0 != main_~p8~0#1); 97859#L159 assume !(0 != main_~p9~0#1); 97721#L164 assume !(0 != main_~p10~0#1); 97723#L169 assume !(0 != main_~p11~0#1); 97343#L44 [2024-11-10 22:45:41,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:41,564 INFO L85 PathProgramCache]: Analyzing trace with hash 4704, now seen corresponding path program 11 times [2024-11-10 22:45:41,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:41,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097935755] [2024-11-10 22:45:41,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:41,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:41,568 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:41,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:41,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:41,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1129199010, now seen corresponding path program 1 times [2024-11-10 22:45:41,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:41,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097650487] [2024-11-10 22:45:41,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:41,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:41,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:41,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:41,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:41,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1271934753, now seen corresponding path program 1 times [2024-11-10 22:45:41,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:41,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896249027] [2024-11-10 22:45:41,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:41,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:41,686 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:41,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:42,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:42,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:45:42 BoogieIcfgContainer [2024-11-10 22:45:42,074 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-10 22:45:42,075 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 22:45:42,075 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 22:45:42,075 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 22:45:42,076 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:45:38" (3/4) ... [2024-11-10 22:45:42,077 INFO L140 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-10 22:45:42,117 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 22:45:42,117 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 22:45:42,118 INFO L158 Benchmark]: Toolchain (without parser) took 4015.56ms. Allocated memory was 180.4MB in the beginning and 809.5MB in the end (delta: 629.1MB). Free memory was 149.1MB in the beginning and 553.9MB in the end (delta: -404.8MB). Peak memory consumption was 223.8MB. Max. memory is 16.1GB. [2024-11-10 22:45:42,118 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory is still 75.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:45:42,121 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.63ms. Allocated memory is still 180.4MB. Free memory was 149.1MB in the beginning and 136.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 22:45:42,121 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.08ms. Allocated memory is still 180.4MB. Free memory was 136.0MB in the beginning and 133.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 22:45:42,122 INFO L158 Benchmark]: Boogie Preprocessor took 21.58ms. Allocated memory is still 180.4MB. Free memory was 133.9MB in the beginning and 132.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 22:45:42,122 INFO L158 Benchmark]: IcfgBuilder took 315.41ms. Allocated memory is still 180.4MB. Free memory was 132.9MB in the beginning and 145.4MB in the end (delta: -12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 22:45:42,122 INFO L158 Benchmark]: BuchiAutomizer took 3403.17ms. Allocated memory was 180.4MB in the beginning and 809.5MB in the end (delta: 629.1MB). Free memory was 145.4MB in the beginning and 556.0MB in the end (delta: -410.6MB). Peak memory consumption was 219.6MB. Max. memory is 16.1GB. [2024-11-10 22:45:42,122 INFO L158 Benchmark]: Witness Printer took 42.52ms. Allocated memory is still 809.5MB. Free memory was 556.0MB in the beginning and 553.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 22:45:42,123 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory is still 75.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.63ms. Allocated memory is still 180.4MB. Free memory was 149.1MB in the beginning and 136.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.08ms. Allocated memory is still 180.4MB. Free memory was 136.0MB in the beginning and 133.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.58ms. Allocated memory is still 180.4MB. Free memory was 133.9MB in the beginning and 132.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 315.41ms. Allocated memory is still 180.4MB. Free memory was 132.9MB in the beginning and 145.4MB in the end (delta: -12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 3403.17ms. Allocated memory was 180.4MB in the beginning and 809.5MB in the end (delta: 629.1MB). Free memory was 145.4MB in the beginning and 556.0MB in the end (delta: -410.6MB). Peak memory consumption was 219.6MB. Max. memory is 16.1GB. * Witness Printer took 42.52ms. Allocated memory is still 809.5MB. Free memory was 556.0MB in the beginning and 553.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 10 terminating modules (10 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.10 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 31746 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 0.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.5s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 463 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 463 mSDsluCounter, 1450 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 553 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52 IncrementalHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 897 mSDtfsCounter, 52 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI10 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 44]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L42] int cond; Loop: [L44] COND TRUE 1 [L45] cond = __VERIFIER_nondet_int() [L46] COND FALSE !(cond == 0) [L49] lk1 = 0 [L51] lk2 = 0 [L53] lk3 = 0 [L55] lk4 = 0 [L57] lk5 = 0 [L59] lk6 = 0 [L61] lk7 = 0 [L63] lk8 = 0 [L65] lk9 = 0 [L67] lk10 = 0 [L69] lk11 = 0 [L73] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L81] COND FALSE !(p3 != 0) [L85] COND FALSE !(p4 != 0) [L89] COND FALSE !(p5 != 0) [L93] COND FALSE !(p6 != 0) [L97] COND FALSE !(p7 != 0) [L101] COND FALSE !(p8 != 0) [L105] COND FALSE !(p9 != 0) [L109] COND FALSE !(p10 != 0) [L113] COND FALSE !(p11 != 0) [L119] COND FALSE !(p1 != 0) [L124] COND FALSE !(p2 != 0) [L129] COND FALSE !(p3 != 0) [L134] COND FALSE !(p4 != 0) [L139] COND FALSE !(p5 != 0) [L144] COND FALSE !(p6 != 0) [L149] COND FALSE !(p7 != 0) [L154] COND FALSE !(p8 != 0) [L159] COND FALSE !(p9 != 0) [L164] COND FALSE !(p10 != 0) [L169] COND FALSE !(p11 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 44]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L42] int cond; Loop: [L44] COND TRUE 1 [L45] cond = __VERIFIER_nondet_int() [L46] COND FALSE !(cond == 0) [L49] lk1 = 0 [L51] lk2 = 0 [L53] lk3 = 0 [L55] lk4 = 0 [L57] lk5 = 0 [L59] lk6 = 0 [L61] lk7 = 0 [L63] lk8 = 0 [L65] lk9 = 0 [L67] lk10 = 0 [L69] lk11 = 0 [L73] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L81] COND FALSE !(p3 != 0) [L85] COND FALSE !(p4 != 0) [L89] COND FALSE !(p5 != 0) [L93] COND FALSE !(p6 != 0) [L97] COND FALSE !(p7 != 0) [L101] COND FALSE !(p8 != 0) [L105] COND FALSE !(p9 != 0) [L109] COND FALSE !(p10 != 0) [L113] COND FALSE !(p11 != 0) [L119] COND FALSE !(p1 != 0) [L124] COND FALSE !(p2 != 0) [L129] COND FALSE !(p3 != 0) [L134] COND FALSE !(p4 != 0) [L139] COND FALSE !(p5 != 0) [L144] COND FALSE !(p6 != 0) [L149] COND FALSE !(p7 != 0) [L154] COND FALSE !(p8 != 0) [L159] COND FALSE !(p9 != 0) [L164] COND FALSE !(p10 != 0) [L169] COND FALSE !(p11 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-10 22:45:42,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)