./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fb960067570884de0638f14e8f74b0912d9ff4ed83f9c3c33e6cd3e420d05661 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:34:15,088 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:34:15,152 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-29 00:34:15,156 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:34:15,157 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:34:15,180 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:34:15,180 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:34:15,181 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:34:15,181 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:34:15,182 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:34:15,182 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:34:15,183 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:34:15,184 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:34:15,184 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-29 00:34:15,185 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-29 00:34:15,185 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-29 00:34:15,186 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-29 00:34:15,186 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-29 00:34:15,187 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-29 00:34:15,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:34:15,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-29 00:34:15,189 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:34:15,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:34:15,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:34:15,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:34:15,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-29 00:34:15,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-29 00:34:15,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-29 00:34:15,192 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:34:15,192 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:34:15,193 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:34:15,193 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-29 00:34:15,193 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:34:15,194 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:34:15,194 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:34:15,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:34:15,194 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:34:15,195 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-29 00:34:15,195 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_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/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_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fb960067570884de0638f14e8f74b0912d9ff4ed83f9c3c33e6cd3e420d05661 [2023-11-29 00:34:15,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:34:15,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:34:15,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:34:15,418 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:34:15,418 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:34:15,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2023-11-29 00:34:18,255 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:34:18,411 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:34:18,411 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2023-11-29 00:34:18,417 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/data/a35409400/0c324b0383ef41e9b1c7a3616835597b/FLAG0ff5b7f47 [2023-11-29 00:34:18,430 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/data/a35409400/0c324b0383ef41e9b1c7a3616835597b [2023-11-29 00:34:18,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:34:18,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:34:18,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:34:18,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:34:18,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:34:18,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:34:18" (1/1) ... [2023-11-29 00:34:18,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33d00623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:18, skipping insertion in model container [2023-11-29 00:34:18,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:34:18" (1/1) ... [2023-11-29 00:34:18,464 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:34:18,630 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:34:18,641 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:34:18,659 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:34:18,675 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:34:18,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:18 WrapperNode [2023-11-29 00:34:18,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:34:18,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:34:18,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:34:18,677 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:34:18,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:18" (1/1) ... [2023-11-29 00:34:18,692 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:18" (1/1) ... [2023-11-29 00:34:18,711 INFO L138 Inliner]: procedures = 15, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2023-11-29 00:34:18,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:34:18,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:34:18,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:34:18,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:34:18,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:18" (1/1) ... [2023-11-29 00:34:18,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:18" (1/1) ... [2023-11-29 00:34:18,727 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:18" (1/1) ... [2023-11-29 00:34:18,743 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2023-11-29 00:34:18,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:18" (1/1) ... [2023-11-29 00:34:18,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:18" (1/1) ... [2023-11-29 00:34:18,750 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:18" (1/1) ... [2023-11-29 00:34:18,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:18" (1/1) ... [2023-11-29 00:34:18,756 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:18" (1/1) ... [2023-11-29 00:34:18,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:18" (1/1) ... [2023-11-29 00:34:18,759 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:34:18,760 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:34:18,760 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:34:18,761 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:34:18,762 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:18" (1/1) ... [2023-11-29 00:34:18,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:34:18,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:34:18,798 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:34:18,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-29 00:34:18,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:34:18,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:34:18,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 00:34:18,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:34:18,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 00:34:18,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 00:34:18,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:34:18,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:34:18,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 00:34:18,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 00:34:18,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:34:18,926 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:34:18,929 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:34:19,058 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:34:19,074 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:34:19,075 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 00:34:19,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:34:19 BoogieIcfgContainer [2023-11-29 00:34:19,077 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:34:19,078 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-29 00:34:19,078 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-29 00:34:19,082 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-29 00:34:19,083 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 00:34:19,083 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:34:18" (1/3) ... [2023-11-29 00:34:19,085 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@173e554f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:34:19, skipping insertion in model container [2023-11-29 00:34:19,085 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 00:34:19,085 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:18" (2/3) ... [2023-11-29 00:34:19,086 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@173e554f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:34:19, skipping insertion in model container [2023-11-29 00:34:19,086 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 00:34:19,086 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:34:19" (3/3) ... [2023-11-29 00:34:19,088 INFO L332 chiAutomizerObserver]: Analyzing ICFG array_assert_loop_dep.i [2023-11-29 00:34:19,139 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-29 00:34:19,139 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-29 00:34:19,139 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-29 00:34:19,139 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-29 00:34:19,139 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-29 00:34:19,140 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-29 00:34:19,140 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-29 00:34:19,140 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-29 00:34:19,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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-29 00:34:19,159 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-29 00:34:19,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:34:19,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:34:19,164 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 00:34:19,164 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 00:34:19,164 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-29 00:34:19,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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-29 00:34:19,166 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-29 00:34:19,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:34:19,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:34:19,167 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 00:34:19,167 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 00:34:19,173 INFO L748 eck$LassoCheckResult]: Stem: 15#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(24, 2); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 13#L18-3true [2023-11-29 00:34:19,174 INFO L750 eck$LassoCheckResult]: Loop: 13#L18-3true assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 12#L18-2true main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 13#L18-3true [2023-11-29 00:34:19,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:19,180 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-29 00:34:19,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:19,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919322688] [2023-11-29 00:34:19,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:19,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:34:19,281 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:34:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:34:19,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:34:19,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:19,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2023-11-29 00:34:19,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:19,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19874942] [2023-11-29 00:34:19,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:19,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:34:19,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:34:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:34:19,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:34:19,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:19,334 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2023-11-29 00:34:19,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:19,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764508769] [2023-11-29 00:34:19,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:19,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:34:19,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:34:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:34:19,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:34:19,705 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 00:34:19,706 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 00:34:19,706 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 00:34:19,706 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 00:34:19,706 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 00:34:19,707 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:34:19,707 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 00:34:19,707 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 00:34:19,707 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_assert_loop_dep.i_Iteration1_Lasso [2023-11-29 00:34:19,707 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 00:34:19,707 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 00:34:19,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:34:19,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:34:19,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:34:19,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:34:19,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:34:19,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 00:34:20,095 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 00:34:20,098 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 00:34:20,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:34:20,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:34:20,101 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:34:20,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-29 00:34:20,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 00:34:20,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:34:20,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:34:20,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:34:20,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:34:20,129 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:34:20,130 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:34:20,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:34:20,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:34:20,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:34:20,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:34:20,144 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:34:20,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-29 00:34:20,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 00:34:20,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:34:20,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:34:20,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:34:20,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:34:20,161 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:34:20,162 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:34:20,166 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:34:20,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-29 00:34:20,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:34:20,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:34:20,171 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:34:20,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-29 00:34:20,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 00:34:20,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:34:20,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 00:34:20,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:34:20,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:34:20,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:34:20,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 00:34:20,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 00:34:20,187 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:34:20,190 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-11-29 00:34:20,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:34:20,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:34:20,192 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:34:20,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-29 00:34:20,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 00:34:20,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:34:20,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:34:20,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:34:20,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:34:20,214 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:34:20,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:34:20,220 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:34:20,224 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-29 00:34:20,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:34:20,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:34:20,226 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:34:20,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-29 00:34:20,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 00:34:20,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:34:20,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:34:20,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:34:20,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:34:20,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:34:20,244 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:34:20,249 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 00:34:20,252 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-29 00:34:20,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:34:20,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:34:20,253 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:34:20,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-29 00:34:20,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 00:34:20,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 00:34:20,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 00:34:20,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 00:34:20,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 00:34:20,280 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 00:34:20,280 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 00:34:20,291 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 00:34:20,337 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-11-29 00:34:20,337 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2023-11-29 00:34:20,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 00:34:20,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:34:20,369 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 00:34:20,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-29 00:34:20,381 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 00:34:20,395 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 00:34:20,395 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 00:34:20,396 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1) = -8*ULTIMATE.start_main_~i~0#1 + 199999*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 Supporting invariants [] [2023-11-29 00:34:20,400 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-11-29 00:34:20,416 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2023-11-29 00:34:20,425 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~#a~0!base] could not be translated [2023-11-29 00:34:20,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:20,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:34:20,461 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:34:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:20,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:34:20,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:34:20,513 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-29 00:34:20,546 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-11-29 00:34:20,549 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-29 00:34:20,599 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 33 states and 47 transitions. Complement of second has 8 states. [2023-11-29 00:34:20,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-29 00:34:20,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-29 00:34:20,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2023-11-29 00:34:20,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 2 letters. [2023-11-29 00:34:20,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 00:34:20,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2023-11-29 00:34:20,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 00:34:20,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 4 letters. [2023-11-29 00:34:20,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 00:34:20,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2023-11-29 00:34:20,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-11-29 00:34:20,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 14 states and 19 transitions. [2023-11-29 00:34:20,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2023-11-29 00:34:20,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-11-29 00:34:20,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2023-11-29 00:34:20,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:34:20,617 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2023-11-29 00:34:20,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2023-11-29 00:34:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-11-29 00:34:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 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-29 00:34:20,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2023-11-29 00:34:20,640 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2023-11-29 00:34:20,640 INFO L428 stractBuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2023-11-29 00:34:20,640 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-29 00:34:20,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2023-11-29 00:34:20,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-11-29 00:34:20,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:34:20,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:34:20,642 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-29 00:34:20,642 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2023-11-29 00:34:20,642 INFO L748 eck$LassoCheckResult]: Stem: 118#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(24, 2); 110#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 111#L18-3 assume !(main_~i~0#1 < 100000); 117#L18-4 main_~i~0#1 := 0; 109#L22-3 [2023-11-29 00:34:20,642 INFO L750 eck$LassoCheckResult]: Loop: 109#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 114#L13 assume !(0 == __VERIFIER_assert_~cond#1); 106#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 107#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 108#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 109#L22-3 [2023-11-29 00:34:20,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:20,643 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2023-11-29 00:34:20,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:20,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970245181] [2023-11-29 00:34:20,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:20,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:20,695 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-29 00:34:20,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:20,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970245181] [2023-11-29 00:34:20,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970245181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:34:20,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:34:20,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:34:20,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735345887] [2023-11-29 00:34:20,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:34:20,699 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 00:34:20,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:20,700 INFO L85 PathProgramCache]: Analyzing trace with hash 51965533, now seen corresponding path program 1 times [2023-11-29 00:34:20,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:20,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963359222] [2023-11-29 00:34:20,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:20,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:34:20,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:34:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:34:20,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:34:20,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-11-29 00:34:20,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:20,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:34:20,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:34:20,867 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-29 00:34:20,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:20,894 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2023-11-29 00:34:20,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2023-11-29 00:34:20,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-29 00:34:20,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 19 transitions. [2023-11-29 00:34:20,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-11-29 00:34:20,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-11-29 00:34:20,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2023-11-29 00:34:20,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:34:20,897 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 19 transitions. [2023-11-29 00:34:20,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2023-11-29 00:34:20,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2023-11-29 00:34:20,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 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-29 00:34:20,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-11-29 00:34:20,900 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-11-29 00:34:20,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:34:20,901 INFO L428 stractBuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-11-29 00:34:20,901 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-29 00:34:20,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2023-11-29 00:34:20,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-29 00:34:20,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:34:20,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:34:20,903 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:34:20,903 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2023-11-29 00:34:20,903 INFO L748 eck$LassoCheckResult]: Stem: 156#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(24, 2); 157#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 150#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 148#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 149#L18-3 assume !(main_~i~0#1 < 100000); 151#L18-4 main_~i~0#1 := 0; 152#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 160#L13 assume !(0 == __VERIFIER_assert_~cond#1); 159#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 153#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 154#L22-2 [2023-11-29 00:34:20,904 INFO L750 eck$LassoCheckResult]: Loop: 154#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 158#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 146#L13 assume !(0 == __VERIFIER_assert_~cond#1); 147#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 155#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 154#L22-2 [2023-11-29 00:34:20,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:20,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1436013086, now seen corresponding path program 1 times [2023-11-29 00:34:20,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:20,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17190198] [2023-11-29 00:34:20,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:20,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:20,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:34:20,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:20,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17190198] [2023-11-29 00:34:20,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17190198] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:34:20,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105141394] [2023-11-29 00:34:20,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:20,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:34:20,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:34:20,977 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:34:20,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 00:34:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:21,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:34:21,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:34:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:34:21,050 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:34:21,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:34:21,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105141394] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:34:21,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:34:21,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-29 00:34:21,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673984526] [2023-11-29 00:34:21,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:34:21,069 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 00:34:21,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:21,069 INFO L85 PathProgramCache]: Analyzing trace with hash 72787423, now seen corresponding path program 2 times [2023-11-29 00:34:21,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:21,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547076366] [2023-11-29 00:34:21,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:21,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:34:21,077 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:34:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:34:21,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:34:21,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:21,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:34:21,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:34:21,191 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-29 00:34:21,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:21,246 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2023-11-29 00:34:21,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2023-11-29 00:34:21,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2023-11-29 00:34:21,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 36 transitions. [2023-11-29 00:34:21,249 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2023-11-29 00:34:21,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2023-11-29 00:34:21,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 36 transitions. [2023-11-29 00:34:21,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:34:21,249 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 36 transitions. [2023-11-29 00:34:21,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 36 transitions. [2023-11-29 00:34:21,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2023-11-29 00:34:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 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-29 00:34:21,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2023-11-29 00:34:21,253 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2023-11-29 00:34:21,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:34:21,254 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2023-11-29 00:34:21,254 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-29 00:34:21,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2023-11-29 00:34:21,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-29 00:34:21,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:34:21,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:34:21,256 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-29 00:34:21,256 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2023-11-29 00:34:21,256 INFO L748 eck$LassoCheckResult]: Stem: 269#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(24, 2); 270#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 262#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 263#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 264#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 260#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 261#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 276#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 275#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 274#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 273#L18-3 assume !(main_~i~0#1 < 100000); 265#L18-4 main_~i~0#1 := 0; 266#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 258#L13 assume !(0 == __VERIFIER_assert_~cond#1); 259#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 271#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 280#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 281#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 283#L13 assume !(0 == __VERIFIER_assert_~cond#1); 282#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 267#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 268#L22-2 [2023-11-29 00:34:21,256 INFO L750 eck$LassoCheckResult]: Loop: 268#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 272#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 279#L13 assume !(0 == __VERIFIER_assert_~cond#1); 278#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 277#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 268#L22-2 [2023-11-29 00:34:21,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:21,257 INFO L85 PathProgramCache]: Analyzing trace with hash -491148388, now seen corresponding path program 1 times [2023-11-29 00:34:21,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:21,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480713710] [2023-11-29 00:34:21,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:21,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 00:34:21,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:21,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480713710] [2023-11-29 00:34:21,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480713710] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:34:21,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950252638] [2023-11-29 00:34:21,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:21,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:34:21,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:34:21,404 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:34:21,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 00:34:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:21,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:34:21,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:34:21,507 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 00:34:21,507 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:34:21,569 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 00:34:21,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950252638] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:34:21,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:34:21,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-29 00:34:21,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131162457] [2023-11-29 00:34:21,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:34:21,570 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 00:34:21,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:21,571 INFO L85 PathProgramCache]: Analyzing trace with hash 72787423, now seen corresponding path program 3 times [2023-11-29 00:34:21,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:21,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793111726] [2023-11-29 00:34:21,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:21,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:34:21,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:34:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:34:21,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:34:21,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:21,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 00:34:21,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-29 00:34:21,697 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 4 Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:34:21,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:21,828 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2023-11-29 00:34:21,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 81 transitions. [2023-11-29 00:34:21,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2023-11-29 00:34:21,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 75 states and 81 transitions. [2023-11-29 00:34:21,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2023-11-29 00:34:21,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2023-11-29 00:34:21,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 81 transitions. [2023-11-29 00:34:21,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:34:21,834 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 81 transitions. [2023-11-29 00:34:21,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 81 transitions. [2023-11-29 00:34:21,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2023-11-29 00:34:21,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:34:21,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2023-11-29 00:34:21,840 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 55 transitions. [2023-11-29 00:34:21,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 00:34:21,841 INFO L428 stractBuchiCegarLoop]: Abstraction has 53 states and 55 transitions. [2023-11-29 00:34:21,841 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-29 00:34:21,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 55 transitions. [2023-11-29 00:34:21,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-29 00:34:21,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:34:21,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:34:21,845 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 5, 5, 4, 1, 1, 1, 1] [2023-11-29 00:34:21,845 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2023-11-29 00:34:21,845 INFO L748 eck$LassoCheckResult]: Stem: 506#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(24, 2); 507#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 499#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 500#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 501#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 497#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 498#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 525#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 524#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 523#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 522#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 521#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 520#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 519#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 518#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 517#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 516#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 515#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 514#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 513#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 512#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 511#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 510#L18-3 assume !(main_~i~0#1 < 100000); 502#L18-4 main_~i~0#1 := 0; 503#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 529#L13 assume !(0 == __VERIFIER_assert_~cond#1); 547#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 546#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 530#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 531#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 528#L13 assume !(0 == __VERIFIER_assert_~cond#1); 526#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 527#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 532#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 545#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 544#L13 assume !(0 == __VERIFIER_assert_~cond#1); 543#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 542#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 541#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 540#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 539#L13 assume !(0 == __VERIFIER_assert_~cond#1); 538#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 537#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 536#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 535#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 534#L13 assume !(0 == __VERIFIER_assert_~cond#1); 533#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 504#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 505#L22-2 [2023-11-29 00:34:21,845 INFO L750 eck$LassoCheckResult]: Loop: 505#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 509#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 495#L13 assume !(0 == __VERIFIER_assert_~cond#1); 496#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 508#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 505#L22-2 [2023-11-29 00:34:21,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:21,846 INFO L85 PathProgramCache]: Analyzing trace with hash -884242768, now seen corresponding path program 2 times [2023-11-29 00:34:21,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:21,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069470257] [2023-11-29 00:34:21,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:21,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:22,207 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-29 00:34:22,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:22,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069470257] [2023-11-29 00:34:22,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069470257] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:34:22,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199744509] [2023-11-29 00:34:22,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:34:22,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:34:22,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:34:22,217 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:34:22,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 00:34:22,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:34:22,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:34:22,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 00:34:22,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:34:22,379 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-29 00:34:22,379 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:34:22,602 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-29 00:34:22,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199744509] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:34:22,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:34:22,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2023-11-29 00:34:22,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971699131] [2023-11-29 00:34:22,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:34:22,604 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 00:34:22,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:22,604 INFO L85 PathProgramCache]: Analyzing trace with hash 72787423, now seen corresponding path program 4 times [2023-11-29 00:34:22,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:22,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080296635] [2023-11-29 00:34:22,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:22,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:34:22,612 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:34:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:34:22,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:34:22,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:22,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 00:34:22,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2023-11-29 00:34:22,713 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. cyclomatic complexity: 4 Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 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-29 00:34:22,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:22,993 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2023-11-29 00:34:22,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 171 transitions. [2023-11-29 00:34:22,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2023-11-29 00:34:22,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 159 states and 171 transitions. [2023-11-29 00:34:22,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2023-11-29 00:34:23,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2023-11-29 00:34:23,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 171 transitions. [2023-11-29 00:34:23,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:34:23,001 INFO L218 hiAutomatonCegarLoop]: Abstraction has 159 states and 171 transitions. [2023-11-29 00:34:23,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 171 transitions. [2023-11-29 00:34:23,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 107. [2023-11-29 00:34:23,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 106 states have internal predecessors, (109), 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-29 00:34:23,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2023-11-29 00:34:23,010 INFO L240 hiAutomatonCegarLoop]: Abstraction has 107 states and 109 transitions. [2023-11-29 00:34:23,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 00:34:23,012 INFO L428 stractBuchiCegarLoop]: Abstraction has 107 states and 109 transitions. [2023-11-29 00:34:23,012 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-29 00:34:23,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 109 transitions. [2023-11-29 00:34:23,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-29 00:34:23,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 00:34:23,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 00:34:23,018 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 11, 11, 11, 11, 10, 1, 1, 1, 1] [2023-11-29 00:34:23,018 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2023-11-29 00:34:23,019 INFO L748 eck$LassoCheckResult]: Stem: 1028#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(24, 2); 1029#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 1021#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1022#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1023#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1019#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1020#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1071#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1070#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1069#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1068#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1067#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1066#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1065#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1064#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1063#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1062#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1061#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1060#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1059#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1058#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1057#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1056#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1055#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1054#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1053#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1052#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1051#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1050#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1049#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1048#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1047#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1046#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1045#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1044#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1043#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1042#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1041#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1040#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1039#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1038#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1037#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1036#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1035#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1034#L18-3 assume !!(main_~i~0#1 < 100000);call write~int#1(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1033#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1032#L18-3 assume !(main_~i~0#1 < 100000); 1024#L18-4 main_~i~0#1 := 0; 1025#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1075#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1123#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1122#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1076#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1077#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1074#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1072#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1073#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1078#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1121#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1120#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1119#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1118#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1117#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1116#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1115#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1114#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1113#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1112#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1111#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1110#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1109#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1108#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1107#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1106#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1105#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1104#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1103#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1102#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1101#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1100#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1099#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1098#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1097#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1096#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1095#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1094#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1093#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1092#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1091#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1090#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1089#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1088#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1087#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1086#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1085#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1084#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1083#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1082#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1081#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1080#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1079#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1026#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1027#L22-2 [2023-11-29 00:34:23,019 INFO L750 eck$LassoCheckResult]: Loop: 1027#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1031#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1017#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1018#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1030#L25 assume 15000 != 1 + main_~i~0#1;call write~int#1(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1027#L22-2 [2023-11-29 00:34:23,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:23,019 INFO L85 PathProgramCache]: Analyzing trace with hash -553358392, now seen corresponding path program 3 times [2023-11-29 00:34:23,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:23,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133802825] [2023-11-29 00:34:23,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:23,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:23,802 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2023-11-29 00:34:23,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:23,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133802825] [2023-11-29 00:34:23,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133802825] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:34:23,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176713173] [2023-11-29 00:34:23,803 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:34:23,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:34:23,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:34:23,809 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:34:23,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 00:34:23,916 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 00:34:23,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:34:23,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 00:34:23,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:34:23,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-11-29 00:34:24,014 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2023-11-29 00:34:24,014 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:34:24,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176713173] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:34:24,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:34:24,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [25] total 28 [2023-11-29 00:34:24,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030534998] [2023-11-29 00:34:24,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:34:24,015 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 00:34:24,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:24,016 INFO L85 PathProgramCache]: Analyzing trace with hash 72787423, now seen corresponding path program 5 times [2023-11-29 00:34:24,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:24,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769039931] [2023-11-29 00:34:24,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:24,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:34:24,021 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:34:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:34:24,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:34:24,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:24,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:34:24,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=450, Unknown=0, NotChecked=0, Total=756 [2023-11-29 00:34:24,127 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-29 00:34:24,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:24,169 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2023-11-29 00:34:24,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 55 transitions. [2023-11-29 00:34:24,170 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-11-29 00:34:24,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 0 states and 0 transitions. [2023-11-29 00:34:24,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-11-29 00:34:24,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-11-29 00:34:24,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-11-29 00:34:24,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:34:24,170 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 00:34:24,170 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 00:34:24,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:34:24,171 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 00:34:24,171 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-29 00:34:24,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-11-29 00:34:24,172 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-11-29 00:34:24,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-11-29 00:34:24,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:34:24 BoogieIcfgContainer [2023-11-29 00:34:24,178 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-29 00:34:24,179 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:34:24,179 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:34:24,179 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:34:24,180 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:34:19" (3/4) ... [2023-11-29 00:34:24,181 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 00:34:24,182 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:34:24,183 INFO L158 Benchmark]: Toolchain (without parser) took 5749.06ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 136.5MB in the beginning and 115.8MB in the end (delta: 20.7MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. [2023-11-29 00:34:24,184 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 102.8MB. Free memory is still 51.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:34:24,184 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.92ms. Allocated memory is still 174.1MB. Free memory was 136.5MB in the beginning and 126.4MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 00:34:24,185 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.41ms. Allocated memory is still 174.1MB. Free memory was 126.4MB in the beginning and 124.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:34:24,185 INFO L158 Benchmark]: Boogie Preprocessor took 46.78ms. Allocated memory is still 174.1MB. Free memory was 124.8MB in the beginning and 122.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:34:24,185 INFO L158 Benchmark]: RCFGBuilder took 317.00ms. Allocated memory is still 174.1MB. Free memory was 122.7MB in the beginning and 112.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 00:34:24,186 INFO L158 Benchmark]: BuchiAutomizer took 5100.60ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 112.2MB in the beginning and 115.8MB in the end (delta: -3.6MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2023-11-29 00:34:24,186 INFO L158 Benchmark]: Witness Printer took 3.59ms. Allocated memory is still 209.7MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:34:24,188 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.17ms. Allocated memory is still 102.8MB. Free memory is still 51.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.92ms. Allocated memory is still 174.1MB. Free memory was 136.5MB in the beginning and 126.4MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.41ms. Allocated memory is still 174.1MB. Free memory was 126.4MB in the beginning and 124.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.78ms. Allocated memory is still 174.1MB. Free memory was 124.8MB in the beginning and 122.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 317.00ms. Allocated memory is still 174.1MB. Free memory was 122.7MB in the beginning and 112.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 5100.60ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 112.2MB in the beginning and 115.8MB in the end (delta: -3.6MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * Witness Printer took 3.59ms. Allocated memory is still 209.7MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[~#a~0!base] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (5 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.0s and 7 iterations. TraceHistogramMax:22. Analysis of lassos took 4.1s. Construction of modules took 0.3s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 83 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 355 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 354 mSDsluCounter, 137 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 152 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 249 IncrementalHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 152 mSolverCounterUnsat, 40 mSDtfsCounter, 249 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital117 mio100 ax100 hnf100 lsp88 ukn75 mio100 lsp43 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2023-11-29 00:34:24,205 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 00:34:24,413 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 00:34:24,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-29 00:34:24,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-29 00:34:25,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cb6e265-8b93-46f2-bbdd-2a6f4030a2bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE