./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_7.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82a36d8b-f471-43b3-b717-b1af4a6dc89b/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82a36d8b-f471-43b3-b717-b1af4a6dc89b/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82a36d8b-f471-43b3-b717-b1af4a6dc89b/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82a36d8b-f471-43b3-b717-b1af4a6dc89b/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_7.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82a36d8b-f471-43b3-b717-b1af4a6dc89b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82a36d8b-f471-43b3-b717-b1af4a6dc89b/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:01:06,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:01:06,907 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82a36d8b-f471-43b3-b717-b1af4a6dc89b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-06 23:01:06,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:01:06,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:01:06,961 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:01:06,961 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:01:06,962 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:01:06,964 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:01:06,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:01:06,969 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:01:06,969 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-06 23:01:06,970 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-06 23:01:06,971 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-06 23:01:06,972 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-06 23:01:06,972 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-06 23:01:06,972 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-06 23:01:06,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:01:06,974 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-06 23:01:06,974 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:01:06,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:01:06,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:01:06,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:01:06,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-06 23:01:06,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-06 23:01:06,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-06 23:01:06,978 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:01:06,979 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:01:06,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:01:06,979 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-06 23:01:06,981 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:01:06,981 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:01:06,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:01:06,982 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:01:06,982 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:01:06,982 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-06 23:01:06,983 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82a36d8b-f471-43b3-b717-b1af4a6dc89b/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82a36d8b-f471-43b3-b717-b1af4a6dc89b/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 [2023-11-06 23:01:07,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:01:07,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:01:07,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:01:07,334 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:01:07,335 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:01:07,336 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82a36d8b-f471-43b3-b717-b1af4a6dc89b/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/locks/test_locks_7.c [2023-11-06 23:01:10,602 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:01:10,779 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:01:10,779 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82a36d8b-f471-43b3-b717-b1af4a6dc89b/sv-benchmarks/c/locks/test_locks_7.c [2023-11-06 23:01:10,788 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82a36d8b-f471-43b3-b717-b1af4a6dc89b/bin/uautomizer-verify-WvqO1wxjHP/data/d3c5248e0/4611a391ce984cde9e383bd20304c5fe/FLAGa078d8219 [2023-11-06 23:01:10,803 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82a36d8b-f471-43b3-b717-b1af4a6dc89b/bin/uautomizer-verify-WvqO1wxjHP/data/d3c5248e0/4611a391ce984cde9e383bd20304c5fe [2023-11-06 23:01:10,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:01:10,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:01:10,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:01:10,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:01:10,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:01:10,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:01:10" (1/1) ... [2023-11-06 23:01:10,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76c4e534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:10, skipping insertion in model container [2023-11-06 23:01:10,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:01:10" (1/1) ... [2023-11-06 23:01:10,853 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:01:11,019 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:01:11,030 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:01:11,052 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:01:11,067 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:01:11,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:11 WrapperNode [2023-11-06 23:01:11,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:01:11,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:01:11,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:01:11,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:01:11,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:11" (1/1) ... [2023-11-06 23:01:11,082 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:11" (1/1) ... [2023-11-06 23:01:11,110 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 105 [2023-11-06 23:01:11,110 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:01:11,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:01:11,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:01:11,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:01:11,121 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:11" (1/1) ... [2023-11-06 23:01:11,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:11" (1/1) ... [2023-11-06 23:01:11,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:11" (1/1) ... [2023-11-06 23:01:11,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:11" (1/1) ... [2023-11-06 23:01:11,137 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:11" (1/1) ... [2023-11-06 23:01:11,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:11" (1/1) ... [2023-11-06 23:01:11,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:11" (1/1) ... [2023-11-06 23:01:11,143 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:11" (1/1) ... [2023-11-06 23:01:11,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:01:11,157 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:01:11,157 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:01:11,157 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:01:11,158 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:11" (1/1) ... [2023-11-06 23:01:11,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 23:01:11,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82a36d8b-f471-43b3-b717-b1af4a6dc89b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:01:11,201 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82a36d8b-f471-43b3-b717-b1af4a6dc89b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 23:01:11,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82a36d8b-f471-43b3-b717-b1af4a6dc89b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-06 23:01:11,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:01:11,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:01:11,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:01:11,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:01:11,330 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:01:11,334 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:01:11,574 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:01:11,581 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:01:11,582 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 23:01:11,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:01:11 BoogieIcfgContainer [2023-11-06 23:01:11,585 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:01:11,587 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-06 23:01:11,587 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-06 23:01:11,591 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-06 23:01:11,592 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 23:01:11,592 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.11 11:01:10" (1/3) ... [2023-11-06 23:01:11,593 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72cd37d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.11 11:01:11, skipping insertion in model container [2023-11-06 23:01:11,593 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 23:01:11,593 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:01:11" (2/3) ... [2023-11-06 23:01:11,596 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72cd37d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.11 11:01:11, skipping insertion in model container [2023-11-06 23:01:11,596 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 23:01:11,596 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:01:11" (3/3) ... [2023-11-06 23:01:11,604 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_7.c [2023-11-06 23:01:11,682 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-06 23:01:11,682 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-06 23:01:11,683 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-06 23:01:11,683 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-06 23:01:11,683 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-06 23:01:11,684 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-06 23:01:11,684 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-06 23:01:11,685 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-06 23:01:11,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 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) [2023-11-06 23:01:11,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-11-06 23:01:11,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 23:01:11,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 23:01:11,720 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 23:01:11,720 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:11,721 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-06 23:01:11,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 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) [2023-11-06 23:01:11,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-11-06 23:01:11,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 23:01:11,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 23:01:11,745 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 23:01:11,745 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:11,753 INFO L748 eck$LassoCheckResult]: Stem: 29#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_~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_~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_~cond~0#1; 17#L113-1true [2023-11-06 23:01:11,755 INFO L750 eck$LassoCheckResult]: Loop: 17#L113-1true assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 27#L34true 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; 30#L53true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 3#L53-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 13#L57-1true assume !(0 != main_~p3~0#1); 9#L61-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 24#L65-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 26#L69-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 11#L73-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 23#L77-1true assume !(0 != main_~p1~0#1); 31#L83-1true assume !(0 != main_~p2~0#1); 15#L88-1true assume !(0 != main_~p3~0#1); 10#L93-1true assume !(0 != main_~p4~0#1); 16#L98-1true assume !(0 != main_~p5~0#1); 7#L103-1true assume !(0 != main_~p6~0#1); 14#L108-1true assume !(0 != main_~p7~0#1); 17#L113-1true [2023-11-06 23:01:11,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:11,761 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-06 23:01:11,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:11,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515367851] [2023-11-06 23:01:11,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:11,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:01:11,861 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:01:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:01:11,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:01:11,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:11,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2067454588, now seen corresponding path program 1 times [2023-11-06 23:01:11,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:11,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586073442] [2023-11-06 23:01:11,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:11,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:11,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:11,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:11,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586073442] [2023-11-06 23:01:11,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586073442] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:11,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:11,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:01:11,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476257087] [2023-11-06 23:01:11,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:11,986 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 23:01:11,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:12,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:01:12,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:01:12,023 INFO L87 Difference]: Start difference. First operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 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 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2023-11-06 23:01:12,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:12,058 INFO L93 Difference]: Finished difference Result 55 states and 93 transitions. [2023-11-06 23:01:12,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 93 transitions. [2023-11-06 23:01:12,063 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2023-11-06 23:01:12,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 47 states and 73 transitions. [2023-11-06 23:01:12,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2023-11-06 23:01:12,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2023-11-06 23:01:12,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 73 transitions. [2023-11-06 23:01:12,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:12,070 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 73 transitions. [2023-11-06 23:01:12,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 73 transitions. [2023-11-06 23:01:12,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-11-06 23:01:12,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.553191489361702) internal successors, (73), 46 states have internal predecessors, (73), 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) [2023-11-06 23:01:12,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2023-11-06 23:01:12,101 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 73 transitions. [2023-11-06 23:01:12,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:01:12,106 INFO L428 stractBuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2023-11-06 23:01:12,106 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-06 23:01:12,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 73 transitions. [2023-11-06 23:01:12,108 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2023-11-06 23:01:12,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 23:01:12,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 23:01:12,109 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 23:01:12,109 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:12,109 INFO L748 eck$LassoCheckResult]: Stem: 120#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 99#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_~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_~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_~cond~0#1; 100#L113-1 [2023-11-06 23:01:12,110 INFO L750 eck$LassoCheckResult]: Loop: 100#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 115#L34 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; 119#L53 assume !(0 != main_~p1~0#1); 122#L53-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 141#L57-1 assume !(0 != main_~p3~0#1); 140#L61-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 139#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 138#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 137#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 136#L77-1 assume !(0 != main_~p1~0#1); 135#L83-1 assume !(0 != main_~p2~0#1); 133#L88-1 assume !(0 != main_~p3~0#1); 131#L93-1 assume !(0 != main_~p4~0#1); 128#L98-1 assume !(0 != main_~p5~0#1); 103#L103-1 assume !(0 != main_~p6~0#1); 105#L108-1 assume !(0 != main_~p7~0#1); 100#L113-1 [2023-11-06 23:01:12,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:12,111 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2023-11-06 23:01:12,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:12,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627419265] [2023-11-06 23:01:12,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:12,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:01:12,119 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:01:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:01:12,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:01:12,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:12,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1216395458, now seen corresponding path program 1 times [2023-11-06 23:01:12,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:12,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345140369] [2023-11-06 23:01:12,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:12,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:12,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:12,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:12,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345140369] [2023-11-06 23:01:12,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345140369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:12,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:12,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:01:12,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102866376] [2023-11-06 23:01:12,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:12,203 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 23:01:12,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:12,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:01:12,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:01:12,204 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2023-11-06 23:01:12,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:12,242 INFO L93 Difference]: Finished difference Result 90 states and 138 transitions. [2023-11-06 23:01:12,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 138 transitions. [2023-11-06 23:01:12,246 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2023-11-06 23:01:12,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 138 transitions. [2023-11-06 23:01:12,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2023-11-06 23:01:12,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2023-11-06 23:01:12,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 138 transitions. [2023-11-06 23:01:12,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:12,258 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 138 transitions. [2023-11-06 23:01:12,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 138 transitions. [2023-11-06 23:01:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-11-06 23:01:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 89 states have internal predecessors, (138), 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) [2023-11-06 23:01:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 138 transitions. [2023-11-06 23:01:12,272 INFO L240 hiAutomatonCegarLoop]: Abstraction has 90 states and 138 transitions. [2023-11-06 23:01:12,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:01:12,277 INFO L428 stractBuchiCegarLoop]: Abstraction has 90 states and 138 transitions. [2023-11-06 23:01:12,277 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-06 23:01:12,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 138 transitions. [2023-11-06 23:01:12,279 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2023-11-06 23:01:12,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 23:01:12,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 23:01:12,280 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 23:01:12,280 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:12,280 INFO L748 eck$LassoCheckResult]: Stem: 272#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 242#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_~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_~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_~cond~0#1; 243#L113-1 [2023-11-06 23:01:12,281 INFO L750 eck$LassoCheckResult]: Loop: 243#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 289#L34 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; 290#L53 assume !(0 != main_~p1~0#1); 305#L53-2 assume !(0 != main_~p2~0#1); 254#L57-1 assume !(0 != main_~p3~0#1); 249#L61-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 250#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 268#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 269#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 297#L77-1 assume !(0 != main_~p1~0#1); 274#L83-1 assume !(0 != main_~p2~0#1); 257#L88-1 assume !(0 != main_~p3~0#1); 259#L93-1 assume !(0 != main_~p4~0#1); 260#L98-1 assume !(0 != main_~p5~0#1); 261#L103-1 assume !(0 != main_~p6~0#1); 308#L108-1 assume !(0 != main_~p7~0#1); 243#L113-1 [2023-11-06 23:01:12,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:12,281 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2023-11-06 23:01:12,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:12,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387171696] [2023-11-06 23:01:12,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:12,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:01:12,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:01:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:01:12,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:01:12,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:12,312 INFO L85 PathProgramCache]: Analyzing trace with hash 629589444, now seen corresponding path program 1 times [2023-11-06 23:01:12,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:12,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323278149] [2023-11-06 23:01:12,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:12,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:12,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:12,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:12,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323278149] [2023-11-06 23:01:12,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323278149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:12,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:12,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:01:12,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352955094] [2023-11-06 23:01:12,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:12,354 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 23:01:12,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:12,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:01:12,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:01:12,355 INFO L87 Difference]: Start difference. First operand 90 states and 138 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2023-11-06 23:01:12,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:12,374 INFO L93 Difference]: Finished difference Result 174 states and 262 transitions. [2023-11-06 23:01:12,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 262 transitions. [2023-11-06 23:01:12,378 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2023-11-06 23:01:12,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 262 transitions. [2023-11-06 23:01:12,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2023-11-06 23:01:12,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2023-11-06 23:01:12,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 262 transitions. [2023-11-06 23:01:12,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:12,383 INFO L218 hiAutomatonCegarLoop]: Abstraction has 174 states and 262 transitions. [2023-11-06 23:01:12,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 262 transitions. [2023-11-06 23:01:12,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2023-11-06 23:01:12,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.5057471264367817) internal successors, (262), 173 states have internal predecessors, (262), 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) [2023-11-06 23:01:12,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 262 transitions. [2023-11-06 23:01:12,406 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 262 transitions. [2023-11-06 23:01:12,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:01:12,408 INFO L428 stractBuchiCegarLoop]: Abstraction has 174 states and 262 transitions. [2023-11-06 23:01:12,408 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-06 23:01:12,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 262 transitions. [2023-11-06 23:01:12,412 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2023-11-06 23:01:12,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 23:01:12,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 23:01:12,414 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 23:01:12,414 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:12,414 INFO L748 eck$LassoCheckResult]: Stem: 540#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 512#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_~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_~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_~cond~0#1; 513#L113-1 [2023-11-06 23:01:12,415 INFO L750 eck$LassoCheckResult]: Loop: 513#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 574#L34 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; 569#L53 assume !(0 != main_~p1~0#1); 570#L53-2 assume !(0 != main_~p2~0#1); 626#L57-1 assume !(0 != main_~p3~0#1); 623#L61-1 assume !(0 != main_~p4~0#1); 619#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 614#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 610#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 606#L77-1 assume !(0 != main_~p1~0#1); 605#L83-1 assume !(0 != main_~p2~0#1); 604#L88-1 assume !(0 != main_~p3~0#1); 601#L93-1 assume !(0 != main_~p4~0#1); 599#L98-1 assume !(0 != main_~p5~0#1); 598#L103-1 assume !(0 != main_~p6~0#1); 596#L108-1 assume !(0 != main_~p7~0#1); 513#L113-1 [2023-11-06 23:01:12,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:12,415 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2023-11-06 23:01:12,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:12,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329498130] [2023-11-06 23:01:12,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:12,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:01:12,422 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:01:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:01:12,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:01:12,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:12,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1330654022, now seen corresponding path program 1 times [2023-11-06 23:01:12,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:12,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611561658] [2023-11-06 23:01:12,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:12,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:12,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:12,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:12,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611561658] [2023-11-06 23:01:12,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611561658] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:12,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:12,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:01:12,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052564730] [2023-11-06 23:01:12,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:12,466 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 23:01:12,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:12,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:01:12,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:01:12,468 INFO L87 Difference]: Start difference. First operand 174 states and 262 transitions. cyclomatic complexity: 96 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2023-11-06 23:01:12,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:12,488 INFO L93 Difference]: Finished difference Result 338 states and 498 transitions. [2023-11-06 23:01:12,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 498 transitions. [2023-11-06 23:01:12,494 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2023-11-06 23:01:12,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 338 states and 498 transitions. [2023-11-06 23:01:12,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 338 [2023-11-06 23:01:12,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 338 [2023-11-06 23:01:12,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 338 states and 498 transitions. [2023-11-06 23:01:12,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:12,502 INFO L218 hiAutomatonCegarLoop]: Abstraction has 338 states and 498 transitions. [2023-11-06 23:01:12,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states and 498 transitions. [2023-11-06 23:01:12,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2023-11-06 23:01:12,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 338 states have (on average 1.4733727810650887) internal successors, (498), 337 states have internal predecessors, (498), 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) [2023-11-06 23:01:12,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 498 transitions. [2023-11-06 23:01:12,534 INFO L240 hiAutomatonCegarLoop]: Abstraction has 338 states and 498 transitions. [2023-11-06 23:01:12,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:01:12,535 INFO L428 stractBuchiCegarLoop]: Abstraction has 338 states and 498 transitions. [2023-11-06 23:01:12,536 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-06 23:01:12,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 338 states and 498 transitions. [2023-11-06 23:01:12,546 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2023-11-06 23:01:12,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 23:01:12,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 23:01:12,549 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 23:01:12,549 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:12,550 INFO L748 eck$LassoCheckResult]: Stem: 1054#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 1030#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_~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_~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_~cond~0#1; 1031#L113-1 [2023-11-06 23:01:12,550 INFO L750 eck$LassoCheckResult]: Loop: 1031#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 1076#L34 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; 1077#L53 assume !(0 != main_~p1~0#1); 1130#L53-2 assume !(0 != main_~p2~0#1); 1127#L57-1 assume !(0 != main_~p3~0#1); 1124#L61-1 assume !(0 != main_~p4~0#1); 1122#L65-1 assume !(0 != main_~p5~0#1); 1120#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1117#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1113#L77-1 assume !(0 != main_~p1~0#1); 1109#L83-1 assume !(0 != main_~p2~0#1); 1107#L88-1 assume !(0 != main_~p3~0#1); 1103#L93-1 assume !(0 != main_~p4~0#1); 1100#L98-1 assume !(0 != main_~p5~0#1); 1101#L103-1 assume !(0 != main_~p6~0#1); 1096#L108-1 assume !(0 != main_~p7~0#1); 1031#L113-1 [2023-11-06 23:01:12,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:12,550 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2023-11-06 23:01:12,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:12,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268001925] [2023-11-06 23:01:12,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:12,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:01:12,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:01:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:01:12,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:01:12,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:12,574 INFO L85 PathProgramCache]: Analyzing trace with hash 937627012, now seen corresponding path program 1 times [2023-11-06 23:01:12,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:12,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057977020] [2023-11-06 23:01:12,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:12,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:12,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:12,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:12,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057977020] [2023-11-06 23:01:12,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057977020] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:12,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:12,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:01:12,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863461594] [2023-11-06 23:01:12,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:12,662 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 23:01:12,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:12,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:01:12,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:01:12,663 INFO L87 Difference]: Start difference. First operand 338 states and 498 transitions. cyclomatic complexity: 176 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2023-11-06 23:01:12,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:12,699 INFO L93 Difference]: Finished difference Result 658 states and 946 transitions. [2023-11-06 23:01:12,699 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 658 states and 946 transitions. [2023-11-06 23:01:12,707 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2023-11-06 23:01:12,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 658 states to 658 states and 946 transitions. [2023-11-06 23:01:12,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 658 [2023-11-06 23:01:12,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 658 [2023-11-06 23:01:12,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 658 states and 946 transitions. [2023-11-06 23:01:12,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:12,722 INFO L218 hiAutomatonCegarLoop]: Abstraction has 658 states and 946 transitions. [2023-11-06 23:01:12,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states and 946 transitions. [2023-11-06 23:01:12,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2023-11-06 23:01:12,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 658 states have (on average 1.4376899696048633) internal successors, (946), 657 states have internal predecessors, (946), 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) [2023-11-06 23:01:12,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 946 transitions. [2023-11-06 23:01:12,752 INFO L240 hiAutomatonCegarLoop]: Abstraction has 658 states and 946 transitions. [2023-11-06 23:01:12,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:01:12,753 INFO L428 stractBuchiCegarLoop]: Abstraction has 658 states and 946 transitions. [2023-11-06 23:01:12,753 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-06 23:01:12,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 658 states and 946 transitions. [2023-11-06 23:01:12,759 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2023-11-06 23:01:12,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 23:01:12,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 23:01:12,760 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 23:01:12,760 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:12,760 INFO L748 eck$LassoCheckResult]: Stem: 2062#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 2032#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_~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_~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_~cond~0#1; 2033#L113-1 [2023-11-06 23:01:12,761 INFO L750 eck$LassoCheckResult]: Loop: 2033#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 2204#L34 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; 2184#L53 assume !(0 != main_~p1~0#1); 2177#L53-2 assume !(0 != main_~p2~0#1); 2179#L57-1 assume !(0 != main_~p3~0#1); 2355#L61-1 assume !(0 != main_~p4~0#1); 2351#L65-1 assume !(0 != main_~p5~0#1); 2348#L69-1 assume !(0 != main_~p6~0#1); 2346#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2344#L77-1 assume !(0 != main_~p1~0#1); 2342#L83-1 assume !(0 != main_~p2~0#1); 2340#L88-1 assume !(0 != main_~p3~0#1); 2337#L93-1 assume !(0 != main_~p4~0#1); 2336#L98-1 assume !(0 != main_~p5~0#1); 2333#L103-1 assume !(0 != main_~p6~0#1); 2334#L108-1 assume !(0 != main_~p7~0#1); 2033#L113-1 [2023-11-06 23:01:12,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:12,761 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2023-11-06 23:01:12,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:12,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266213444] [2023-11-06 23:01:12,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:12,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:01:12,769 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:01:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:01:12,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:01:12,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:12,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1617685382, now seen corresponding path program 1 times [2023-11-06 23:01:12,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:12,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309746953] [2023-11-06 23:01:12,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:12,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:12,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:12,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:12,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309746953] [2023-11-06 23:01:12,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309746953] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:12,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:12,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:01:12,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133250640] [2023-11-06 23:01:12,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:12,833 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 23:01:12,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:12,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:01:12,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:01:12,834 INFO L87 Difference]: Start difference. First operand 658 states and 946 transitions. cyclomatic complexity: 320 Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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) [2023-11-06 23:01:12,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:12,855 INFO L93 Difference]: Finished difference Result 1282 states and 1794 transitions. [2023-11-06 23:01:12,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1282 states and 1794 transitions. [2023-11-06 23:01:12,868 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2023-11-06 23:01:12,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1282 states to 1282 states and 1794 transitions. [2023-11-06 23:01:12,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1282 [2023-11-06 23:01:12,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1282 [2023-11-06 23:01:12,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1282 states and 1794 transitions. [2023-11-06 23:01:12,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:12,884 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2023-11-06 23:01:12,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states and 1794 transitions. [2023-11-06 23:01:12,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1282. [2023-11-06 23:01:12,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1282 states have (on average 1.3993759750390016) internal successors, (1794), 1281 states have internal predecessors, (1794), 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) [2023-11-06 23:01:12,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1794 transitions. [2023-11-06 23:01:12,918 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2023-11-06 23:01:12,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:01:12,920 INFO L428 stractBuchiCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2023-11-06 23:01:12,920 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-06 23:01:12,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1282 states and 1794 transitions. [2023-11-06 23:01:12,930 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2023-11-06 23:01:12,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 23:01:12,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 23:01:12,931 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 23:01:12,932 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:12,932 INFO L748 eck$LassoCheckResult]: Stem: 4013#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 3978#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_~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_~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_~cond~0#1; 3979#L113-1 [2023-11-06 23:01:12,932 INFO L750 eck$LassoCheckResult]: Loop: 3979#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 4219#L34 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; 4217#L53 assume !(0 != main_~p1~0#1); 4212#L53-2 assume !(0 != main_~p2~0#1); 4206#L57-1 assume !(0 != main_~p3~0#1); 4201#L61-1 assume !(0 != main_~p4~0#1); 4202#L65-1 assume !(0 != main_~p5~0#1); 4249#L69-1 assume !(0 != main_~p6~0#1); 4247#L73-1 assume !(0 != main_~p7~0#1); 4243#L77-1 assume !(0 != main_~p1~0#1); 4235#L83-1 assume !(0 != main_~p2~0#1); 4234#L88-1 assume !(0 != main_~p3~0#1); 4081#L93-1 assume !(0 != main_~p4~0#1); 4082#L98-1 assume !(0 != main_~p5~0#1); 4226#L103-1 assume !(0 != main_~p6~0#1); 4223#L108-1 assume !(0 != main_~p7~0#1); 3979#L113-1 [2023-11-06 23:01:12,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:12,933 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2023-11-06 23:01:12,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:12,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312642165] [2023-11-06 23:01:12,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:12,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:01:12,950 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:01:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:01:12,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:01:12,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:12,957 INFO L85 PathProgramCache]: Analyzing trace with hash 808338756, now seen corresponding path program 1 times [2023-11-06 23:01:12,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:12,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317723665] [2023-11-06 23:01:12,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:12,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:01:12,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:01:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:01:12,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:01:12,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:12,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1317176582, now seen corresponding path program 1 times [2023-11-06 23:01:12,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:12,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625547441] [2023-11-06 23:01:12,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:12,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:01:12,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:01:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:01:13,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:01:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:01:13,472 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:01:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:01:13,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.11 11:01:13 BoogieIcfgContainer [2023-11-06 23:01:13,506 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-06 23:01:13,507 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:01:13,507 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:01:13,507 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:01:13,508 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:01:11" (3/4) ... [2023-11-06 23:01:13,509 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-11-06 23:01:13,555 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82a36d8b-f471-43b3-b717-b1af4a6dc89b/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 23:01:13,555 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:01:13,556 INFO L158 Benchmark]: Toolchain (without parser) took 2748.57ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 57.2MB in the end (delta: 48.9MB). Peak memory consumption was 51.6MB. Max. memory is 16.1GB. [2023-11-06 23:01:13,556 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 100.7MB. Free memory is still 51.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:01:13,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.32ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 95.4MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 23:01:13,557 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.94ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 93.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:01:13,558 INFO L158 Benchmark]: Boogie Preprocessor took 45.40ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:01:13,558 INFO L158 Benchmark]: RCFGBuilder took 427.62ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 81.7MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 23:01:13,559 INFO L158 Benchmark]: BuchiAutomizer took 1919.93ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 59.3MB in the end (delta: 22.1MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2023-11-06 23:01:13,559 INFO L158 Benchmark]: Witness Printer took 48.30ms. Allocated memory is still 142.6MB. Free memory was 59.3MB in the beginning and 57.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:01:13,562 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.67ms. Allocated memory is still 100.7MB. Free memory is still 51.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.32ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 95.4MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.94ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 93.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.40ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 427.62ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 81.7MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 1919.93ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 59.3MB in the end (delta: 22.1MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * Witness Printer took 48.30ms. Allocated memory is still 142.6MB. Free memory was 59.3MB in the beginning and 57.2MB 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 6 terminating modules (6 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.6 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 1282 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 177 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 177 mSDsluCounter, 556 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 207 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 349 mSDtfsCounter, 32 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI6 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: 32]: 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; [L30] int cond; Loop: [L32] COND TRUE 1 [L33] cond = __VERIFIER_nondet_int() [L34] COND FALSE !(cond == 0) [L37] lk1 = 0 [L39] lk2 = 0 [L41] lk3 = 0 [L43] lk4 = 0 [L45] lk5 = 0 [L47] lk6 = 0 [L49] lk7 = 0 [L53] COND FALSE !(p1 != 0) [L57] COND FALSE !(p2 != 0) [L61] COND FALSE !(p3 != 0) [L65] COND FALSE !(p4 != 0) [L69] COND FALSE !(p5 != 0) [L73] COND FALSE !(p6 != 0) [L77] COND FALSE !(p7 != 0) [L83] COND FALSE !(p1 != 0) [L88] COND FALSE !(p2 != 0) [L93] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L103] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L113] COND FALSE !(p7 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 32]: 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; [L30] int cond; Loop: [L32] COND TRUE 1 [L33] cond = __VERIFIER_nondet_int() [L34] COND FALSE !(cond == 0) [L37] lk1 = 0 [L39] lk2 = 0 [L41] lk3 = 0 [L43] lk4 = 0 [L45] lk5 = 0 [L47] lk6 = 0 [L49] lk7 = 0 [L53] COND FALSE !(p1 != 0) [L57] COND FALSE !(p2 != 0) [L61] COND FALSE !(p3 != 0) [L65] COND FALSE !(p4 != 0) [L69] COND FALSE !(p5 != 0) [L73] COND FALSE !(p6 != 0) [L77] COND FALSE !(p7 != 0) [L83] COND FALSE !(p1 != 0) [L88] COND FALSE !(p2 != 0) [L93] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L103] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L113] COND FALSE !(p7 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-11-06 23:01:13,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_82a36d8b-f471-43b3-b717-b1af4a6dc89b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)