./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu --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 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:59:27,568 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:59:27,690 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-19 07:59:27,695 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:59:27,695 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:59:27,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:59:27,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:59:27,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:59:27,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:59:27,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:59:27,740 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:59:27,741 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-19 07:59:27,742 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-19 07:59:27,742 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-19 07:59:27,743 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-19 07:59:27,743 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-19 07:59:27,744 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-19 07:59:27,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:59:27,745 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-19 07:59:27,745 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:59:27,746 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:59:27,746 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:59:27,747 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:59:27,747 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-19 07:59:27,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-19 07:59:27,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-19 07:59:27,749 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:59:27,749 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:59:27,750 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:59:27,750 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-19 07:59:27,751 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:59:27,751 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:59:27,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:59:27,752 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:59:27,753 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:59:27,753 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-19 07:59:27,754 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_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/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_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu 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 -> 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 [2023-11-19 07:59:28,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:59:28,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:59:28,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:59:28,134 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:59:28,135 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:59:28,136 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2023-11-19 07:59:31,483 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:59:31,773 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:59:31,774 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2023-11-19 07:59:31,783 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/data/f333c1fb3/224c613ba0694d0ebc0f5e192e6e58a3/FLAGd93055232 [2023-11-19 07:59:31,801 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/data/f333c1fb3/224c613ba0694d0ebc0f5e192e6e58a3 [2023-11-19 07:59:31,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:59:31,806 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:59:31,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:59:31,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:59:31,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:59:31,816 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:59:31" (1/1) ... [2023-11-19 07:59:31,817 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1587aeec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:31, skipping insertion in model container [2023-11-19 07:59:31,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:59:31" (1/1) ... [2023-11-19 07:59:31,855 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:59:32,071 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:59:32,086 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:59:32,107 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:59:32,126 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:59:32,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32 WrapperNode [2023-11-19 07:59:32,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:59:32,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:59:32,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:59:32,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:59:32,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32" (1/1) ... [2023-11-19 07:59:32,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32" (1/1) ... [2023-11-19 07:59:32,172 INFO L138 Inliner]: procedures = 14, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2023-11-19 07:59:32,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:59:32,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:59:32,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:59:32,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:59:32,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32" (1/1) ... [2023-11-19 07:59:32,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32" (1/1) ... [2023-11-19 07:59:32,204 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32" (1/1) ... [2023-11-19 07:59:32,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32" (1/1) ... [2023-11-19 07:59:32,220 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32" (1/1) ... [2023-11-19 07:59:32,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32" (1/1) ... [2023-11-19 07:59:32,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32" (1/1) ... [2023-11-19 07:59:32,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32" (1/1) ... [2023-11-19 07:59:32,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:59:32,243 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:59:32,244 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:59:32,249 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:59:32,251 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32" (1/1) ... [2023-11-19 07:59:32,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:59:32,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:59:32,293 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:59:32,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-19 07:59:32,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:59:32,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:59:32,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:59:32,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:59:32,355 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_23_0 [2023-11-19 07:59:32,355 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_23_0 [2023-11-19 07:59:32,356 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2023-11-19 07:59:32,356 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2023-11-19 07:59:32,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:59:32,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:59:32,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:59:32,357 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_22_0 [2023-11-19 07:59:32,357 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_22_0 [2023-11-19 07:59:32,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:59:32,447 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:59:32,449 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:59:32,730 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:59:32,740 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:59:32,741 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:59:32,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:59:32 BoogieIcfgContainer [2023-11-19 07:59:32,746 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:59:32,747 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-19 07:59:32,748 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-19 07:59:32,753 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-19 07:59:32,754 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:59:32,754 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 07:59:31" (1/3) ... [2023-11-19 07:59:32,756 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ff02fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 07:59:32, skipping insertion in model container [2023-11-19 07:59:32,756 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:59:32,756 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:32" (2/3) ... [2023-11-19 07:59:32,757 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ff02fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 07:59:32, skipping insertion in model container [2023-11-19 07:59:32,757 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:59:32,758 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:59:32" (3/3) ... [2023-11-19 07:59:32,766 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_3.c [2023-11-19 07:59:32,849 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-19 07:59:32,849 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-19 07:59:32,849 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-19 07:59:32,850 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-19 07:59:32,850 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-19 07:59:32,850 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-19 07:59:32,851 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-19 07:59:32,851 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-19 07:59:32,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:59:32,882 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-19 07:59:32,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:59:32,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:59:32,890 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 07:59:32,891 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:32,891 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-19 07:59:32,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:59:32,896 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-19 07:59:32,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:59:32,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:59:32,898 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 07:59:32,898 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:32,908 INFO L748 eck$LassoCheckResult]: Stem: 30#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 5#L86true call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 28#$Ultimate##0true [2023-11-19 07:59:32,909 INFO L750 eck$LassoCheckResult]: Loop: 28#$Ultimate##0true ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int(~a.base, ~a.offset, 4); 16#L61true assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~b.base, ~b.offset, 4); 31#L67true call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 25#$Ultimate##0true ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int(~b.base, ~b.offset, 4); 19#L41true assume !(#t~mem7 < 6);havoc #t~mem7; 18#L41-1true assume true; 27#func_to_recursive_line_22_to_23_0EXITtrue >#70#return; 32#L67-1true call #t~mem11 := read~int(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 3#L72true call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 28#$Ultimate##0true [2023-11-19 07:59:32,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:32,918 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 1 times [2023-11-19 07:59:32,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:32,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370694978] [2023-11-19 07:59:32,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:32,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:33,128 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:59:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:33,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:59:33,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:33,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1113047060, now seen corresponding path program 1 times [2023-11-19 07:59:33,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:33,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126698688] [2023-11-19 07:59:33,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:33,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:33,901 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-19 07:59:33,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:33,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126698688] [2023-11-19 07:59:33,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126698688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:33,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:33,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:59:33,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704211596] [2023-11-19 07:59:33,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:33,913 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:59:33,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:33,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:59:33,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:59:33,984 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 07:59:34,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:59:34,260 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2023-11-19 07:59:34,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2023-11-19 07:59:34,275 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-19 07:59:34,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 24 states and 29 transitions. [2023-11-19 07:59:34,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2023-11-19 07:59:34,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2023-11-19 07:59:34,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 29 transitions. [2023-11-19 07:59:34,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:34,294 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-11-19 07:59:34,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 29 transitions. [2023-11-19 07:59:34,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2023-11-19 07:59:34,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-19 07:59:34,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-11-19 07:59:34,343 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-11-19 07:59:34,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:59:34,352 INFO L428 stractBuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-11-19 07:59:34,353 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-19 07:59:34,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2023-11-19 07:59:34,357 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-19 07:59:34,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:59:34,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:59:34,360 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 07:59:34,360 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:34,361 INFO L748 eck$LassoCheckResult]: Stem: 108#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 105#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 90#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 91#$Ultimate##0 [2023-11-19 07:59:34,362 INFO L750 eck$LassoCheckResult]: Loop: 91#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int(~a.base, ~a.offset, 4); 107#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~b.base, ~b.offset, 4); 97#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 102#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int(~b.base, ~b.offset, 4); 101#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~c.base, ~c.offset, 4); 93#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 92#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 95#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 104#L25-1 assume true; 103#func_to_recursive_line_23_to_23_0EXIT >#64#return; 100#L47-1 call #t~mem8 := read~int(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 98#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 102#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int(~b.base, ~b.offset, 4); 101#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 96#L41-1 assume true; 99#func_to_recursive_line_22_to_23_0EXIT >#66#return; 106#L41-1 assume true; 110#func_to_recursive_line_22_to_23_0EXIT >#70#return; 109#L67-1 call #t~mem11 := read~int(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 89#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 91#$Ultimate##0 [2023-11-19 07:59:34,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:34,365 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 2 times [2023-11-19 07:59:34,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:34,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731001470] [2023-11-19 07:59:34,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:34,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:34,411 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:59:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:34,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:59:34,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:34,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1122494970, now seen corresponding path program 1 times [2023-11-19 07:59:34,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:34,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085626550] [2023-11-19 07:59:34,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:34,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:34,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:34,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:59:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 07:59:35,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:35,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085626550] [2023-11-19 07:59:35,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085626550] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:35,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:35,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:59:35,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469267026] [2023-11-19 07:59:35,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:35,017 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:59:35,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:35,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:59:35,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:59:35,019 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. cyclomatic complexity: 7 Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:59:35,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:59:35,161 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2023-11-19 07:59:35,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2023-11-19 07:59:35,165 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-19 07:59:35,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2023-11-19 07:59:35,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2023-11-19 07:59:35,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2023-11-19 07:59:35,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2023-11-19 07:59:35,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:35,179 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-11-19 07:59:35,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2023-11-19 07:59:35,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-19 07:59:35,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-19 07:59:35,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-11-19 07:59:35,189 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-11-19 07:59:35,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:59:35,192 INFO L428 stractBuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-11-19 07:59:35,196 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-19 07:59:35,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2023-11-19 07:59:35,198 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-19 07:59:35,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:59:35,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:59:35,201 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 07:59:35,201 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:35,202 INFO L748 eck$LassoCheckResult]: Stem: 191#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 187#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 172#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 173#$Ultimate##0 [2023-11-19 07:59:35,202 INFO L750 eck$LassoCheckResult]: Loop: 173#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int(~a.base, ~a.offset, 4); 190#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~b.base, ~b.offset, 4); 175#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 184#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int(~b.base, ~b.offset, 4); 183#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~c.base, ~c.offset, 4); 179#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 178#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 181#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 180#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 178#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 181#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 188#L25-1 assume true; 185#func_to_recursive_line_23_to_23_0EXIT >#62#return; 186#L25-1 assume true; 194#func_to_recursive_line_23_to_23_0EXIT >#64#return; 182#L47-1 call #t~mem8 := read~int(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 176#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 184#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int(~b.base, ~b.offset, 4); 183#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 174#L41-1 assume true; 177#func_to_recursive_line_22_to_23_0EXIT >#66#return; 189#L41-1 assume true; 193#func_to_recursive_line_22_to_23_0EXIT >#70#return; 192#L67-1 call #t~mem11 := read~int(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 171#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 173#$Ultimate##0 [2023-11-19 07:59:35,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:35,203 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 3 times [2023-11-19 07:59:35,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:35,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804408826] [2023-11-19 07:59:35,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:35,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:35,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:59:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:35,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:59:35,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:35,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1944809856, now seen corresponding path program 1 times [2023-11-19 07:59:35,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:35,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538042513] [2023-11-19 07:59:35,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:35,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:35,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-19 07:59:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,166 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 07:59:36,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:36,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538042513] [2023-11-19 07:59:36,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538042513] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:59:36,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230266728] [2023-11-19 07:59:36,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:36,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:59:36,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:59:36,173 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:59:36,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:59:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:36,295 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-19 07:59:36,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:59:36,410 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 15 treesize of output 1 [2023-11-19 07:59:36,661 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 07:59:36,661 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:59:37,306 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 07:59:37,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230266728] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:59:37,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:59:37,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 21 [2023-11-19 07:59:37,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833581398] [2023-11-19 07:59:37,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:59:37,309 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:59:37,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:37,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-19 07:59:37,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2023-11-19 07:59:37,311 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. cyclomatic complexity: 7 Second operand has 21 states, 15 states have (on average 2.0) internal successors, (30), 18 states have internal predecessors, (30), 8 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-19 07:59:37,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:59:37,711 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2023-11-19 07:59:37,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2023-11-19 07:59:37,713 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-19 07:59:37,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 30 transitions. [2023-11-19 07:59:37,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2023-11-19 07:59:37,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2023-11-19 07:59:37,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2023-11-19 07:59:37,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:37,716 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-11-19 07:59:37,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2023-11-19 07:59:37,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-19 07:59:37,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-19 07:59:37,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-11-19 07:59:37,721 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-11-19 07:59:37,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 07:59:37,724 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-11-19 07:59:37,725 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-19 07:59:37,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 30 transitions. [2023-11-19 07:59:37,727 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-19 07:59:37,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:59:37,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:59:37,731 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 07:59:37,732 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:37,732 INFO L748 eck$LassoCheckResult]: Stem: 458#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 452#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 439#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 440#$Ultimate##0 [2023-11-19 07:59:37,732 INFO L750 eck$LassoCheckResult]: Loop: 440#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int(~a.base, ~a.offset, 4); 457#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~b.base, ~b.offset, 4); 443#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 451#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int(~b.base, ~b.offset, 4); 449#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~c.base, ~c.offset, 4); 447#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 445#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 446#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 445#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 448#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 446#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 445#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 448#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 455#L25-1 assume true; 453#func_to_recursive_line_23_to_23_0EXIT >#62#return; 454#L25-1 assume true; 463#func_to_recursive_line_23_to_23_0EXIT >#62#return; 462#L25-1 assume true; 461#func_to_recursive_line_23_to_23_0EXIT >#64#return; 450#L47-1 call #t~mem8 := read~int(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 442#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 451#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int(~b.base, ~b.offset, 4); 449#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 441#L41-1 assume true; 444#func_to_recursive_line_22_to_23_0EXIT >#66#return; 456#L41-1 assume true; 460#func_to_recursive_line_22_to_23_0EXIT >#70#return; 459#L67-1 call #t~mem11 := read~int(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 438#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 440#$Ultimate##0 [2023-11-19 07:59:37,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:37,733 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 4 times [2023-11-19 07:59:37,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:37,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665682365] [2023-11-19 07:59:37,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:37,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:37,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:59:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:37,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:59:37,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:37,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1076062706, now seen corresponding path program 2 times [2023-11-19 07:59:37,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:37,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768443522] [2023-11-19 07:59:37,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:37,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:38,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:38,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:38,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:38,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:38,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:59:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:38,845 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-19 07:59:38,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:38,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768443522] [2023-11-19 07:59:38,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768443522] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:59:38,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707574738] [2023-11-19 07:59:38,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 07:59:38,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:59:38,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:59:38,879 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:59:38,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:59:38,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 07:59:38,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:59:39,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-19 07:59:39,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:59:39,041 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 15 treesize of output 1 [2023-11-19 07:59:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-19 07:59:39,316 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:59:40,389 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 07:59:40,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707574738] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:59:40,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:59:40,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 14] total 26 [2023-11-19 07:59:40,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948563255] [2023-11-19 07:59:40,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:59:40,391 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:59:40,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:40,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-19 07:59:40,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2023-11-19 07:59:40,393 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. cyclomatic complexity: 7 Second operand has 26 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 22 states have internal predecessors, (34), 9 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (12), 5 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-19 07:59:40,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:59:40,831 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2023-11-19 07:59:40,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2023-11-19 07:59:40,833 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-19 07:59:40,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2023-11-19 07:59:40,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2023-11-19 07:59:40,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2023-11-19 07:59:40,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2023-11-19 07:59:40,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:40,835 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-11-19 07:59:40,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2023-11-19 07:59:40,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-19 07:59:40,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-19 07:59:40,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-11-19 07:59:40,840 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-11-19 07:59:40,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 07:59:40,846 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-11-19 07:59:40,848 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-19 07:59:40,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2023-11-19 07:59:40,850 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-19 07:59:40,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:59:40,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:59:40,855 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 07:59:40,855 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:40,856 INFO L748 eck$LassoCheckResult]: Stem: 783#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 777#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 764#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 765#$Ultimate##0 [2023-11-19 07:59:40,856 INFO L750 eck$LassoCheckResult]: Loop: 765#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int(~a.base, ~a.offset, 4); 782#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~b.base, ~b.offset, 4); 767#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 776#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int(~b.base, ~b.offset, 4); 774#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~c.base, ~c.offset, 4); 771#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 770#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 773#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 772#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 770#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 773#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 772#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 770#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 773#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 772#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 770#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 773#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 780#L25-1 assume true; 778#func_to_recursive_line_23_to_23_0EXIT >#62#return; 779#L25-1 assume true; 790#func_to_recursive_line_23_to_23_0EXIT >#62#return; 789#L25-1 assume true; 788#func_to_recursive_line_23_to_23_0EXIT >#62#return; 787#L25-1 assume true; 786#func_to_recursive_line_23_to_23_0EXIT >#64#return; 775#L47-1 call #t~mem8 := read~int(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 768#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 776#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int(~b.base, ~b.offset, 4); 774#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 766#L41-1 assume true; 769#func_to_recursive_line_22_to_23_0EXIT >#66#return; 781#L41-1 assume true; 785#func_to_recursive_line_22_to_23_0EXIT >#70#return; 784#L67-1 call #t~mem11 := read~int(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 763#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 765#$Ultimate##0 [2023-11-19 07:59:40,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:40,857 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 5 times [2023-11-19 07:59:40,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:40,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424172212] [2023-11-19 07:59:40,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:40,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:40,872 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:59:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:40,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:59:40,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:40,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1667775892, now seen corresponding path program 3 times [2023-11-19 07:59:40,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:40,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659972857] [2023-11-19 07:59:40,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:40,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:41,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:41,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:42,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:42,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:42,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:42,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:59:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:42,363 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-19 07:59:42,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:42,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659972857] [2023-11-19 07:59:42,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659972857] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:59:42,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102597942] [2023-11-19 07:59:42,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 07:59:42,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:59:42,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:59:42,369 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:59:42,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 07:59:42,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-19 07:59:42,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:59:42,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-19 07:59:42,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:59:42,564 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 15 treesize of output 1 [2023-11-19 07:59:42,905 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-19 07:59:42,906 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:59:44,451 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 07:59:44,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102597942] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:59:44,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:59:44,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 18] total 31 [2023-11-19 07:59:44,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363308993] [2023-11-19 07:59:44,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:59:44,453 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:59:44,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:44,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-19 07:59:44,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2023-11-19 07:59:44,455 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 7 Second operand has 31 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 26 states have internal predecessors, (38), 10 states have call successors, (14), 7 states have call predecessors, (14), 10 states have return successors, (15), 7 states have call predecessors, (15), 10 states have call successors, (15) [2023-11-19 07:59:45,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:59:45,013 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2023-11-19 07:59:45,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2023-11-19 07:59:45,016 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-19 07:59:45,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 34 transitions. [2023-11-19 07:59:45,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2023-11-19 07:59:45,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2023-11-19 07:59:45,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 34 transitions. [2023-11-19 07:59:45,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:45,021 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-11-19 07:59:45,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 34 transitions. [2023-11-19 07:59:45,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-19 07:59:45,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-19 07:59:45,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-11-19 07:59:45,034 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-11-19 07:59:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 07:59:45,039 INFO L428 stractBuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-11-19 07:59:45,039 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-19 07:59:45,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 34 transitions. [2023-11-19 07:59:45,040 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-19 07:59:45,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:59:45,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:59:45,044 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 07:59:45,044 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:45,045 INFO L748 eck$LassoCheckResult]: Stem: 1171#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 1165#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1152#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 1153#$Ultimate##0 [2023-11-19 07:59:45,045 INFO L750 eck$LassoCheckResult]: Loop: 1153#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int(~a.base, ~a.offset, 4); 1170#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~b.base, ~b.offset, 4); 1155#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1164#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int(~b.base, ~b.offset, 4); 1162#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~c.base, ~c.offset, 4); 1159#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1158#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 1161#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1160#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1158#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 1161#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1160#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1158#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 1161#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1160#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1158#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 1161#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1160#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1158#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 1161#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1168#L25-1 assume true; 1166#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1167#L25-1 assume true; 1180#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1179#L25-1 assume true; 1178#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1177#L25-1 assume true; 1176#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1175#L25-1 assume true; 1174#func_to_recursive_line_23_to_23_0EXIT >#64#return; 1163#L47-1 call #t~mem8 := read~int(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 1156#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1164#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int(~b.base, ~b.offset, 4); 1162#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1154#L41-1 assume true; 1157#func_to_recursive_line_22_to_23_0EXIT >#66#return; 1169#L41-1 assume true; 1173#func_to_recursive_line_22_to_23_0EXIT >#70#return; 1172#L67-1 call #t~mem11 := read~int(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 1151#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 1153#$Ultimate##0 [2023-11-19 07:59:45,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:45,046 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 6 times [2023-11-19 07:59:45,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:45,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848974481] [2023-11-19 07:59:45,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:45,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:45,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:59:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:45,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:59:45,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:45,073 INFO L85 PathProgramCache]: Analyzing trace with hash -802224162, now seen corresponding path program 4 times [2023-11-19 07:59:45,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:45,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174534366] [2023-11-19 07:59:45,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:45,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:45,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:45,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:46,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:46,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:46,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:46,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:46,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:59:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:46,811 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-19 07:59:46,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:46,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174534366] [2023-11-19 07:59:46,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174534366] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:59:46,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816042522] [2023-11-19 07:59:46,812 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-19 07:59:46,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:59:46,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:59:46,817 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:59:46,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 07:59:46,955 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-19 07:59:46,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:59:46,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-19 07:59:46,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:59:46,998 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 15 treesize of output 1 [2023-11-19 07:59:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-19 07:59:47,382 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:59:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 07:59:49,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816042522] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:59:49,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:59:49,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 22] total 36 [2023-11-19 07:59:49,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250670686] [2023-11-19 07:59:49,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:59:49,531 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:59:49,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:49,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-19 07:59:49,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1029, Unknown=0, NotChecked=0, Total=1260 [2023-11-19 07:59:49,533 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. cyclomatic complexity: 7 Second operand has 36 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 30 states have internal predecessors, (42), 11 states have call successors, (15), 8 states have call predecessors, (15), 12 states have return successors, (18), 9 states have call predecessors, (18), 11 states have call successors, (18) [2023-11-19 07:59:50,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:59:50,141 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2023-11-19 07:59:50,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2023-11-19 07:59:50,143 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-19 07:59:50,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 36 transitions. [2023-11-19 07:59:50,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2023-11-19 07:59:50,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2023-11-19 07:59:50,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 36 transitions. [2023-11-19 07:59:50,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:50,146 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-11-19 07:59:50,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 36 transitions. [2023-11-19 07:59:50,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-19 07:59:50,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 6 states have call successors, (6), 3 states have call predecessors, (6), 8 states have return successors, (10), 8 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-19 07:59:50,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-11-19 07:59:50,152 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-11-19 07:59:50,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-19 07:59:50,153 INFO L428 stractBuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-11-19 07:59:50,153 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-19 07:59:50,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 36 transitions. [2023-11-19 07:59:50,155 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-19 07:59:50,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:59:50,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:59:50,156 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 07:59:50,157 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:50,157 INFO L748 eck$LassoCheckResult]: Stem: 1628#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 1623#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1608#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 1609#$Ultimate##0 [2023-11-19 07:59:50,157 INFO L750 eck$LassoCheckResult]: Loop: 1609#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int(~a.base, ~a.offset, 4); 1627#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~b.base, ~b.offset, 4); 1611#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1620#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int(~b.base, ~b.offset, 4); 1619#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~c.base, ~c.offset, 4); 1616#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1614#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 1617#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1615#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1614#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 1617#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1615#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1614#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 1617#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1615#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1614#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 1617#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1615#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1614#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 1617#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1615#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1614#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 1617#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1625#L25-1 assume true; 1621#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1622#L25-1 assume true; 1624#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1638#L25-1 assume true; 1637#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1636#L25-1 assume true; 1635#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1634#L25-1 assume true; 1633#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1632#L25-1 assume true; 1631#func_to_recursive_line_23_to_23_0EXIT >#64#return; 1618#L47-1 call #t~mem8 := read~int(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 1612#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1620#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int(~b.base, ~b.offset, 4); 1619#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1610#L41-1 assume true; 1613#func_to_recursive_line_22_to_23_0EXIT >#66#return; 1626#L41-1 assume true; 1630#func_to_recursive_line_22_to_23_0EXIT >#70#return; 1629#L67-1 call #t~mem11 := read~int(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 1607#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 1609#$Ultimate##0 [2023-11-19 07:59:50,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:50,158 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 7 times [2023-11-19 07:59:50,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:50,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685766917] [2023-11-19 07:59:50,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:50,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:50,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:59:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:50,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:59:50,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:50,177 INFO L85 PathProgramCache]: Analyzing trace with hash 217514072, now seen corresponding path program 5 times [2023-11-19 07:59:50,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:50,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385219452] [2023-11-19 07:59:50,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:50,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:50,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:51,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:51,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:52,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:52,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:52,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:52,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:52,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:59:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:52,564 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-19 07:59:52,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:52,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385219452] [2023-11-19 07:59:52,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385219452] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:59:52,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745953718] [2023-11-19 07:59:52,565 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-19 07:59:52,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:59:52,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:59:52,579 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:59:52,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-19 07:59:52,740 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-11-19 07:59:52,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:59:52,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 77 conjunts are in the unsatisfiable core [2023-11-19 07:59:52,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:59:52,764 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 15 treesize of output 1 [2023-11-19 07:59:53,183 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-19 07:59:53,183 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:59:55,853 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 2 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 07:59:55,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745953718] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:59:55,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:59:55,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 26] total 38 [2023-11-19 07:59:55,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308497326] [2023-11-19 07:59:55,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:59:55,855 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:59:55,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:59:55,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-19 07:59:55,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=1119, Unknown=0, NotChecked=0, Total=1406 [2023-11-19 07:59:55,857 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. cyclomatic complexity: 7 Second operand has 38 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 10 states have call successors, (15), 9 states have call predecessors, (15), 14 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2023-11-19 07:59:56,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:59:56,338 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2023-11-19 07:59:56,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 38 transitions. [2023-11-19 07:59:56,339 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-19 07:59:56,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 38 transitions. [2023-11-19 07:59:56,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2023-11-19 07:59:56,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2023-11-19 07:59:56,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 38 transitions. [2023-11-19 07:59:56,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:59:56,341 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 38 transitions. [2023-11-19 07:59:56,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 38 transitions. [2023-11-19 07:59:56,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-11-19 07:59:56,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 9 states have return successors, (11), 9 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-19 07:59:56,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2023-11-19 07:59:56,345 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 38 transitions. [2023-11-19 07:59:56,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 07:59:56,346 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2023-11-19 07:59:56,347 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-19 07:59:56,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 38 transitions. [2023-11-19 07:59:56,347 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2023-11-19 07:59:56,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:59:56,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:59:56,349 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 07:59:56,349 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:56,349 INFO L748 eck$LassoCheckResult]: Stem: 2152#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 2147#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 2132#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 2133#$Ultimate##0 [2023-11-19 07:59:56,350 INFO L750 eck$LassoCheckResult]: Loop: 2133#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int(~a.base, ~a.offset, 4); 2151#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~b.base, ~b.offset, 4); 2135#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 2144#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int(~b.base, ~b.offset, 4); 2143#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~c.base, ~c.offset, 4); 2139#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2138#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 2141#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2140#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2138#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 2141#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2140#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2138#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 2141#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2140#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2138#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 2141#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2140#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2138#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 2141#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2140#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2138#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 2141#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2140#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2138#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int(~c.base, ~c.offset, 4); 2141#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2149#L25-1 assume true; 2145#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2146#L25-1 assume true; 2148#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2164#L25-1 assume true; 2163#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2162#L25-1 assume true; 2161#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2160#L25-1 assume true; 2159#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2158#L25-1 assume true; 2157#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2156#L25-1 assume true; 2155#func_to_recursive_line_23_to_23_0EXIT >#64#return; 2142#L47-1 call #t~mem8 := read~int(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 2136#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 2144#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int(~b.base, ~b.offset, 4); 2143#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2134#L41-1 assume true; 2137#func_to_recursive_line_22_to_23_0EXIT >#66#return; 2150#L41-1 assume true; 2154#func_to_recursive_line_22_to_23_0EXIT >#70#return; 2153#L67-1 call #t~mem11 := read~int(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 2131#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 2133#$Ultimate##0 [2023-11-19 07:59:56,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:56,350 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 8 times [2023-11-19 07:59:56,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:56,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268060847] [2023-11-19 07:59:56,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:56,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:56,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:59:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:56,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:59:56,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:56,367 INFO L85 PathProgramCache]: Analyzing trace with hash 157151178, now seen corresponding path program 6 times [2023-11-19 07:59:56,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:56,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574296849] [2023-11-19 07:59:56,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:56,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:56,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:59:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:59:56,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:59:56,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:56,425 INFO L85 PathProgramCache]: Analyzing trace with hash -2037760919, now seen corresponding path program 1 times [2023-11-19 07:59:56,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:59:56,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062981137] [2023-11-19 07:59:56,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:56,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:59:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:57,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:59:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:57,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:58,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:58,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:58,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:59,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:59,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:59,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:59:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:59,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:59:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-11-19 07:59:59,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:59:59,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062981137] [2023-11-19 07:59:59,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062981137] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:59:59,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443313418] [2023-11-19 07:59:59,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:59,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:59:59,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:59:59,545 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:59:59,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4b19bd-7587-416e-96c2-98eb54397e0e/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-19 07:59:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:59,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 88 conjunts are in the unsatisfiable core [2023-11-19 07:59:59,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:59:59,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-11-19 07:59:59,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-19 08:00:12,085 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_37| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_37| |c_#memory_int|))) (and (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= |v_old(#memory_int)_AFTER_CALL_37| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_37| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_37| .cse0 (select |c_#memory_int| .cse0))))))) is different from false