./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/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_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/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_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/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 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:05:49,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:05:49,522 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-19 08:05:49,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:05:49,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:05:49,575 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:05:49,576 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:05:49,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:05:49,578 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:05:49,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:05:49,587 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:05:49,587 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-19 08:05:49,588 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-19 08:05:49,590 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-19 08:05:49,590 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-19 08:05:49,591 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-19 08:05:49,591 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-19 08:05:49,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:05:49,593 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-19 08:05:49,593 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:05:49,593 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:05:49,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:05:49,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:05:49,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-19 08:05:49,596 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-19 08:05:49,596 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-19 08:05:49,596 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 08:05:49,597 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:05:49,597 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 08:05:49,598 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-19 08:05:49,599 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:05:49,599 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:05:49,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:05:49,600 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:05:49,600 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:05:49,601 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-19 08:05:49,601 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_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/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_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/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 -> 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 [2023-11-19 08:05:49,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:05:49,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:05:49,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:05:49,911 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:05:49,912 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:05:49,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2023-11-19 08:05:53,065 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:05:53,304 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:05:53,306 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2023-11-19 08:05:53,315 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/bin/uautomizer-verify-uCwYo4JHxu/data/935c4b977/7af62e8e5ab844aea75b24a50cfcdd73/FLAG3f689548e [2023-11-19 08:05:53,328 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/bin/uautomizer-verify-uCwYo4JHxu/data/935c4b977/7af62e8e5ab844aea75b24a50cfcdd73 [2023-11-19 08:05:53,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:05:53,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:05:53,334 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:05:53,334 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:05:53,339 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:05:53,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:05:53" (1/1) ... [2023-11-19 08:05:53,341 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eb596b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:53, skipping insertion in model container [2023-11-19 08:05:53,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:05:53" (1/1) ... [2023-11-19 08:05:53,366 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:05:53,551 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:05:53,567 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:05:53,597 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:05:53,612 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:05:53,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:53 WrapperNode [2023-11-19 08:05:53,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:05:53,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:05:53,614 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:05:53,614 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:05:53,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:53" (1/1) ... [2023-11-19 08:05:53,643 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:53" (1/1) ... [2023-11-19 08:05:53,663 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2023-11-19 08:05:53,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:05:53,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:05:53,665 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:05:53,665 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:05:53,674 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:53" (1/1) ... [2023-11-19 08:05:53,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:53" (1/1) ... [2023-11-19 08:05:53,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:53" (1/1) ... [2023-11-19 08:05:53,678 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:53" (1/1) ... [2023-11-19 08:05:53,685 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:53" (1/1) ... [2023-11-19 08:05:53,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:53" (1/1) ... [2023-11-19 08:05:53,689 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:53" (1/1) ... [2023-11-19 08:05:53,691 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:53" (1/1) ... [2023-11-19 08:05:53,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:05:53,704 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:05:53,704 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:05:53,704 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:05:53,705 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:53" (1/1) ... [2023-11-19 08:05:53,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 08:05:53,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:05:53,741 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 08:05:53,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-19 08:05:53,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:05:53,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:05:53,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:05:53,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:05:53,786 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2023-11-19 08:05:53,786 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2023-11-19 08:05:53,786 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2023-11-19 08:05:53,786 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2023-11-19 08:05:53,787 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2023-11-19 08:05:53,787 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2023-11-19 08:05:53,787 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_25_0 [2023-11-19 08:05:53,787 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_25_0 [2023-11-19 08:05:53,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:05:53,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:05:53,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 08:05:53,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:05:53,875 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:05:53,877 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:05:54,148 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:05:54,156 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:05:54,156 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 08:05:54,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:05:54 BoogieIcfgContainer [2023-11-19 08:05:54,160 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:05:54,162 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-19 08:05:54,162 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-19 08:05:54,166 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-19 08:05:54,167 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 08:05:54,167 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 08:05:53" (1/3) ... [2023-11-19 08:05:54,168 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3013c978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 08:05:54, skipping insertion in model container [2023-11-19 08:05:54,168 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 08:05:54,168 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:53" (2/3) ... [2023-11-19 08:05:54,169 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3013c978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 08:05:54, skipping insertion in model container [2023-11-19 08:05:54,169 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 08:05:54,169 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:05:54" (3/3) ... [2023-11-19 08:05:54,184 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_4.c [2023-11-19 08:05:54,247 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-19 08:05:54,247 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-19 08:05:54,247 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-19 08:05:54,247 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-19 08:05:54,248 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-19 08:05:54,248 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-19 08:05:54,248 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-19 08:05:54,248 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-19 08:05:54,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 08:05:54,274 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-19 08:05:54,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:05:54,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:05:54,281 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 08:05:54,282 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:54,282 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-19 08:05:54,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 08:05:54,287 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-19 08:05:54,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:05:54,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:05:54,289 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 08:05:54,289 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:54,296 INFO L748 eck$LassoCheckResult]: Stem: 37#$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); 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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, main_~#d~0#1.base, main_~#d~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 main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 29#L107true call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 33#$Ultimate##0true [2023-11-19 08:05:54,297 INFO L750 eck$LassoCheckResult]: Loop: 33#$Ultimate##0true ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int(~a.base, ~a.offset, 4); 10#L81true assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~b.base, ~b.offset, 4); 21#L87true call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 20#$Ultimate##0true ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~b.base, ~b.offset, 4); 24#L61true assume !(#t~mem10 < 6);havoc #t~mem10; 6#L61-1true assume true; 9#func_to_recursive_line_23_to_24_0EXITtrue >#88#return; 15#L87-1true call #t~mem14 := read~int(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 7#L92true call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 33#$Ultimate##0true [2023-11-19 08:05:54,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:54,302 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 1 times [2023-11-19 08:05:54,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:54,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551623583] [2023-11-19 08:05:54,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:54,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:05:54,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:05:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:05:54,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:05:54,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:54,504 INFO L85 PathProgramCache]: Analyzing trace with hash -448633028, now seen corresponding path program 1 times [2023-11-19 08:05:54,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:54,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647287192] [2023-11-19 08:05:54,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:54,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:54,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:54,932 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 08:05:54,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:54,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647287192] [2023-11-19 08:05:54,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647287192] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:54,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:54,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 08:05:54,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153128255] [2023-11-19 08:05:54,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:54,939 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 08:05:54,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:54,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:05:54,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:05:54,976 INFO L87 Difference]: Start difference. First operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) 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 08:05:55,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:05:55,159 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2023-11-19 08:05:55,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 61 transitions. [2023-11-19 08:05:55,165 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-19 08:05:55,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 33 states and 41 transitions. [2023-11-19 08:05:55,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2023-11-19 08:05:55,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2023-11-19 08:05:55,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2023-11-19 08:05:55,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:55,177 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 41 transitions. [2023-11-19 08:05:55,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2023-11-19 08:05:55,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2023-11-19 08:05:55,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 20 states have internal predecessors, (20), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-19 08:05:55,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-11-19 08:05:55,211 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-11-19 08:05:55,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:05:55,217 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-11-19 08:05:55,217 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-19 08:05:55,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2023-11-19 08:05:55,219 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-19 08:05:55,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:05:55,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:05:55,220 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 08:05:55,220 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 08:05:55,221 INFO L748 eck$LassoCheckResult]: Stem: 136#$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); 124#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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, main_~#d~0#1.base, main_~#d~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 main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 120#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 121#$Ultimate##0 [2023-11-19 08:05:55,221 INFO L750 eck$LassoCheckResult]: Loop: 121#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int(~a.base, ~a.offset, 4); 123#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~b.base, ~b.offset, 4); 110#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 111#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~b.base, ~b.offset, 4); 131#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~c.base, ~c.offset, 4); 113#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 125#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int(~c.base, ~c.offset, 4); 112#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 116#L41-1 assume true; 132#func_to_recursive_line_24_to_25_0EXIT >#84#return; 134#L67-1 call #t~mem11 := read~int(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 109#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 111#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~b.base, ~b.offset, 4); 131#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 117#L61-1 assume true; 118#func_to_recursive_line_23_to_24_0EXIT >#86#return; 122#L61-1 assume true; 137#func_to_recursive_line_23_to_24_0EXIT >#88#return; 128#L87-1 call #t~mem14 := read~int(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 119#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 121#$Ultimate##0 [2023-11-19 08:05:55,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:55,222 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 2 times [2023-11-19 08:05:55,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:55,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444484458] [2023-11-19 08:05:55,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:55,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:05:55,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:05:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:05:55,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:05:55,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:55,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1860565822, now seen corresponding path program 1 times [2023-11-19 08:05:55,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:55,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396604825] [2023-11-19 08:05:55,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:55,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:55,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:55,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:55,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 08:05:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:55,751 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 08:05:55,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:55,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396604825] [2023-11-19 08:05:55,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396604825] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:55,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:55,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 08:05:55,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200389051] [2023-11-19 08:05:55,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:55,755 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 08:05:55,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:55,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:05:55,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:05:55,757 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. cyclomatic complexity: 10 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 08:05:55,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:05:55,918 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2023-11-19 08:05:55,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2023-11-19 08:05:55,923 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-19 08:05:55,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 40 transitions. [2023-11-19 08:05:55,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2023-11-19 08:05:55,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2023-11-19 08:05:55,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2023-11-19 08:05:55,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:55,930 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 40 transitions. [2023-11-19 08:05:55,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2023-11-19 08:05:55,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2023-11-19 08:05:55,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 21 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-11-19 08:05:55,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-11-19 08:05:55,936 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-11-19 08:05:55,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:05:55,937 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-11-19 08:05:55,938 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-19 08:05:55,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2023-11-19 08:05:55,939 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-19 08:05:55,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:05:55,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:05:55,941 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 08:05:55,941 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, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:55,941 INFO L748 eck$LassoCheckResult]: Stem: 235#$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); 222#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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, main_~#d~0#1.base, main_~#d~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 main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 218#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 219#$Ultimate##0 [2023-11-19 08:05:55,942 INFO L750 eck$LassoCheckResult]: Loop: 219#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int(~a.base, ~a.offset, 4); 221#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~b.base, ~b.offset, 4); 208#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 209#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~b.base, ~b.offset, 4); 229#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~c.base, ~c.offset, 4); 212#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 223#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int(~c.base, ~c.offset, 4); 210#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~d.base, ~d.offset, 4); 213#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 225#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int(~d.base, ~d.offset, 4); 236#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 227#L25-1 assume true; 228#func_to_recursive_line_25_to_25_0EXIT >#80#return; 232#L47-1 call #t~mem8 := read~int(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 211#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 223#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int(~c.base, ~c.offset, 4); 210#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 214#L41-1 assume true; 234#func_to_recursive_line_24_to_25_0EXIT >#82#return; 230#L41-1 assume true; 231#func_to_recursive_line_24_to_25_0EXIT >#84#return; 233#L67-1 call #t~mem11 := read~int(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 207#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 209#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~b.base, ~b.offset, 4); 229#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 215#L61-1 assume true; 216#func_to_recursive_line_23_to_24_0EXIT >#86#return; 220#L61-1 assume true; 237#func_to_recursive_line_23_to_24_0EXIT >#88#return; 226#L87-1 call #t~mem14 := read~int(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 217#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 219#$Ultimate##0 [2023-11-19 08:05:55,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:55,943 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 3 times [2023-11-19 08:05:55,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:55,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510974453] [2023-11-19 08:05:55,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:55,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:05:55,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:05:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:05:55,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:05:55,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:55,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1780666575, now seen corresponding path program 1 times [2023-11-19 08:05:55,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:55,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999970045] [2023-11-19 08:05:55,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:55,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:56,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:56,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:56,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:56,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 08:05:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:56,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-19 08:05:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 08:05:56,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:56,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999970045] [2023-11-19 08:05:56,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999970045] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:56,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:56,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 08:05:56,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478595003] [2023-11-19 08:05:56,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:56,435 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 08:05:56,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:56,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:05:56,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:05:56,436 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-19 08:05:56,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:05:56,542 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2023-11-19 08:05:56,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2023-11-19 08:05:56,544 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-19 08:05:56,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 39 transitions. [2023-11-19 08:05:56,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2023-11-19 08:05:56,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2023-11-19 08:05:56,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2023-11-19 08:05:56,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:56,547 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-11-19 08:05:56,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2023-11-19 08:05:56,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-19 08:05:56,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 22 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2023-11-19 08:05:56,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-11-19 08:05:56,558 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-11-19 08:05:56,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:05:56,560 INFO L428 stractBuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-11-19 08:05:56,561 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-19 08:05:56,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2023-11-19 08:05:56,562 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-19 08:05:56,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:05:56,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:05:56,566 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 08:05:56,566 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:56,566 INFO L748 eck$LassoCheckResult]: Stem: 365#$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); 352#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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, main_~#d~0#1.base, main_~#d~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 main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 348#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 349#$Ultimate##0 [2023-11-19 08:05:56,567 INFO L750 eck$LassoCheckResult]: Loop: 349#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int(~a.base, ~a.offset, 4); 351#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~b.base, ~b.offset, 4); 338#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 339#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~b.base, ~b.offset, 4); 359#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~c.base, ~c.offset, 4); 342#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 353#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int(~c.base, ~c.offset, 4); 340#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~d.base, ~d.offset, 4); 343#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 355#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int(~d.base, ~d.offset, 4); 366#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 354#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 355#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int(~d.base, ~d.offset, 4); 366#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 357#L25-1 assume true; 358#func_to_recursive_line_25_to_25_0EXIT >#92#return; 361#L25-1 assume true; 367#func_to_recursive_line_25_to_25_0EXIT >#80#return; 362#L47-1 call #t~mem8 := read~int(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 341#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 353#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int(~c.base, ~c.offset, 4); 340#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 344#L41-1 assume true; 360#func_to_recursive_line_24_to_25_0EXIT >#82#return; 364#L41-1 assume true; 369#func_to_recursive_line_24_to_25_0EXIT >#84#return; 363#L67-1 call #t~mem11 := read~int(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 337#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 339#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~b.base, ~b.offset, 4); 359#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 345#L61-1 assume true; 346#func_to_recursive_line_23_to_24_0EXIT >#86#return; 350#L61-1 assume true; 368#func_to_recursive_line_23_to_24_0EXIT >#88#return; 356#L87-1 call #t~mem14 := read~int(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 347#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 349#$Ultimate##0 [2023-11-19 08:05:56,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:56,567 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 4 times [2023-11-19 08:05:56,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:56,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673974025] [2023-11-19 08:05:56,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:56,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:05:56,596 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:05:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:05:56,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:05:56,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:56,607 INFO L85 PathProgramCache]: Analyzing trace with hash -971158242, now seen corresponding path program 1 times [2023-11-19 08:05:56,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:56,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651482760] [2023-11-19 08:05:56,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:56,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:56,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:57,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:57,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:57,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:57,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-19 08:05:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:57,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-19 08:05:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:57,475 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 08:05:57,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:57,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651482760] [2023-11-19 08:05:57,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651482760] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:05:57,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432070877] [2023-11-19 08:05:57,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:57,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:05:57,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:05:57,479 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:05:57,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 08:05:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:57,622 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-19 08:05:57,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:05:57,694 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 11 treesize of output 7 [2023-11-19 08:05:57,907 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 08:05:57,907 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:05:58,682 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 08:05:58,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432070877] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:05:58,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:05:58,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 21 [2023-11-19 08:05:58,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981961154] [2023-11-19 08:05:58,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:05:58,691 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 08:05:58,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:58,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-19 08:05:58,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2023-11-19 08:05:58,694 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. cyclomatic complexity: 10 Second operand has 21 states, 16 states have (on average 2.4375) internal successors, (39), 18 states have internal predecessors, (39), 7 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (12), 4 states have call predecessors, (12), 7 states have call successors, (12) [2023-11-19 08:05:59,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:05:59,103 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2023-11-19 08:05:59,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2023-11-19 08:05:59,104 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-19 08:05:59,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 43 transitions. [2023-11-19 08:05:59,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2023-11-19 08:05:59,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2023-11-19 08:05:59,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2023-11-19 08:05:59,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:59,112 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 43 transitions. [2023-11-19 08:05:59,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2023-11-19 08:05:59,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-19 08:05:59,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2023-11-19 08:05:59,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2023-11-19 08:05:59,122 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 43 transitions. [2023-11-19 08:05:59,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 08:05:59,124 INFO L428 stractBuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2023-11-19 08:05:59,125 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-19 08:05:59,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 43 transitions. [2023-11-19 08:05:59,126 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-19 08:05:59,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:05:59,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:05:59,130 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 08:05:59,131 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:59,131 INFO L748 eck$LassoCheckResult]: Stem: 753#$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); 740#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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, main_~#d~0#1.base, main_~#d~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 main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 736#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 737#$Ultimate##0 [2023-11-19 08:05:59,131 INFO L750 eck$LassoCheckResult]: Loop: 737#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int(~a.base, ~a.offset, 4); 739#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~b.base, ~b.offset, 4); 726#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 727#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~b.base, ~b.offset, 4); 747#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~c.base, ~c.offset, 4); 730#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 741#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int(~c.base, ~c.offset, 4); 728#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~d.base, ~d.offset, 4); 731#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 744#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int(~d.base, ~d.offset, 4); 754#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 743#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 744#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int(~d.base, ~d.offset, 4); 754#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 743#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 744#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int(~d.base, ~d.offset, 4); 754#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 743#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 744#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int(~d.base, ~d.offset, 4); 754#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 745#L25-1 assume true; 746#func_to_recursive_line_25_to_25_0EXIT >#92#return; 749#L25-1 assume true; 760#func_to_recursive_line_25_to_25_0EXIT >#92#return; 759#L25-1 assume true; 758#func_to_recursive_line_25_to_25_0EXIT >#92#return; 757#L25-1 assume true; 756#func_to_recursive_line_25_to_25_0EXIT >#80#return; 750#L47-1 call #t~mem8 := read~int(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 729#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 741#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int(~c.base, ~c.offset, 4); 728#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 732#L41-1 assume true; 748#func_to_recursive_line_24_to_25_0EXIT >#82#return; 752#L41-1 assume true; 761#func_to_recursive_line_24_to_25_0EXIT >#84#return; 751#L67-1 call #t~mem11 := read~int(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 725#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 727#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~b.base, ~b.offset, 4); 747#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 733#L61-1 assume true; 734#func_to_recursive_line_23_to_24_0EXIT >#86#return; 738#L61-1 assume true; 755#func_to_recursive_line_23_to_24_0EXIT >#88#return; 742#L87-1 call #t~mem14 := read~int(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 735#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 737#$Ultimate##0 [2023-11-19 08:05:59,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:59,132 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 5 times [2023-11-19 08:05:59,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:59,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733006964] [2023-11-19 08:05:59,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:59,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:05:59,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:05:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:05:59,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:05:59,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:59,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2092880572, now seen corresponding path program 2 times [2023-11-19 08:05:59,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:59,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999680869] [2023-11-19 08:05:59,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:59,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:59,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:00,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:06:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:00,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:06:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:00,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:06:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:01,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:06:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:01,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:06:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:01,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 08:06:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:01,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 08:06:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 08:06:01,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:06:01,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999680869] [2023-11-19 08:06:01,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999680869] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:06:01,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435103601] [2023-11-19 08:06:01,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 08:06:01,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:06:01,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:06:01,273 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:06:01,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 08:06:01,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 08:06:01,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 08:06:01,459 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-19 08:06:01,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:06:01,502 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 11 treesize of output 7 [2023-11-19 08:06:01,822 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 08:06:01,822 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:06:03,523 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 08:06:03,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435103601] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:06:03,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:06:03,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 18] total 36 [2023-11-19 08:06:03,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102062953] [2023-11-19 08:06:03,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:06:03,525 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 08:06:03,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:06:03,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-19 08:06:03,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1040, Unknown=0, NotChecked=0, Total=1260 [2023-11-19 08:06:03,527 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. cyclomatic complexity: 10 Second operand has 36 states, 27 states have (on average 1.962962962962963) internal successors, (53), 31 states have internal predecessors, (53), 12 states have call successors, (21), 7 states have call predecessors, (21), 11 states have return successors, (19), 8 states have call predecessors, (19), 12 states have call successors, (19) [2023-11-19 08:06:04,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:06:04,232 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2023-11-19 08:06:04,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 47 transitions. [2023-11-19 08:06:04,233 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-19 08:06:04,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 47 transitions. [2023-11-19 08:06:04,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2023-11-19 08:06:04,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2023-11-19 08:06:04,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2023-11-19 08:06:04,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:04,236 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-11-19 08:06:04,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2023-11-19 08:06:04,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-19 08:06:04,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 26 states have internal predecessors, (26), 8 states have call successors, (8), 4 states have call predecessors, (8), 10 states have return successors, (13), 10 states have call predecessors, (13), 6 states have call successors, (13) [2023-11-19 08:06:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2023-11-19 08:06:04,241 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-11-19 08:06:04,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-19 08:06:04,242 INFO L428 stractBuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-11-19 08:06:04,242 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-19 08:06:04,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 47 transitions. [2023-11-19 08:06:04,244 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-19 08:06:04,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:06:04,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:06:04,245 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 08:06:04,246 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:06:04,246 INFO L748 eck$LassoCheckResult]: Stem: 1286#$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); 1272#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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, main_~#d~0#1.base, main_~#d~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 main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1268#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 1269#$Ultimate##0 [2023-11-19 08:06:04,246 INFO L750 eck$LassoCheckResult]: Loop: 1269#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int(~a.base, ~a.offset, 4); 1271#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~b.base, ~b.offset, 4); 1258#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1259#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~b.base, ~b.offset, 4); 1279#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~c.base, ~c.offset, 4); 1262#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1273#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int(~c.base, ~c.offset, 4); 1260#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~d.base, ~d.offset, 4); 1263#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1275#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int(~d.base, ~d.offset, 4); 1285#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1274#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1275#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int(~d.base, ~d.offset, 4); 1285#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1274#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1275#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int(~d.base, ~d.offset, 4); 1285#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1274#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1275#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int(~d.base, ~d.offset, 4); 1285#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1274#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1275#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int(~d.base, ~d.offset, 4); 1285#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1274#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1275#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int(~d.base, ~d.offset, 4); 1285#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1277#L25-1 assume true; 1278#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1281#L25-1 assume true; 1297#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1296#L25-1 assume true; 1295#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1294#L25-1 assume true; 1293#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1291#L25-1 assume true; 1290#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1288#L25-1 assume true; 1287#func_to_recursive_line_25_to_25_0EXIT >#80#return; 1282#L47-1 call #t~mem8 := read~int(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 1261#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1273#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int(~c.base, ~c.offset, 4); 1260#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1264#L41-1 assume true; 1280#func_to_recursive_line_24_to_25_0EXIT >#82#return; 1284#L41-1 assume true; 1292#func_to_recursive_line_24_to_25_0EXIT >#84#return; 1283#L67-1 call #t~mem11 := read~int(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 1257#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1259#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~b.base, ~b.offset, 4); 1279#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1265#L61-1 assume true; 1266#func_to_recursive_line_23_to_24_0EXIT >#86#return; 1270#L61-1 assume true; 1289#func_to_recursive_line_23_to_24_0EXIT >#88#return; 1276#L87-1 call #t~mem14 := read~int(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 1267#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 1269#$Ultimate##0 [2023-11-19 08:06:04,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:04,247 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 6 times [2023-11-19 08:06:04,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:04,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774287874] [2023-11-19 08:06:04,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:04,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:06:04,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:06:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:06:04,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:06:04,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:04,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1778629226, now seen corresponding path program 3 times [2023-11-19 08:06:04,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:04,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383042701] [2023-11-19 08:06:04,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:04,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:05,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:06:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:05,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:06:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:06,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:06:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:06,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:06:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:07,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:06:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:07,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:06:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:07,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:06:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:07,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:06:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:07,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 08:06:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:07,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 08:06:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:07,689 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-19 08:06:07,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:06:07,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383042701] [2023-11-19 08:06:07,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383042701] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:06:07,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82730059] [2023-11-19 08:06:07,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 08:06:07,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:06:07,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:06:07,695 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:06:07,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 08:06:07,980 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-11-19 08:06:07,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 08:06:07,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 74 conjunts are in the unsatisfiable core [2023-11-19 08:06:07,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:06:08,000 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 11 treesize of output 7 [2023-11-19 08:06:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-19 08:06:08,429 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:06:11,436 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 08:06:11,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82730059] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:06:11,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:06:11,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 26] total 43 [2023-11-19 08:06:11,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680764967] [2023-11-19 08:06:11,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:06:11,439 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 08:06:11,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:06:11,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-19 08:06:11,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1457, Unknown=0, NotChecked=0, Total=1806 [2023-11-19 08:06:11,442 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. cyclomatic complexity: 10 Second operand has 43 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 36 states have internal predecessors, (57), 12 states have call successors, (21), 9 states have call predecessors, (21), 15 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2023-11-19 08:06:12,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:06:12,305 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2023-11-19 08:06:12,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 49 transitions. [2023-11-19 08:06:12,311 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-19 08:06:12,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 49 transitions. [2023-11-19 08:06:12,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2023-11-19 08:06:12,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2023-11-19 08:06:12,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 49 transitions. [2023-11-19 08:06:12,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:12,322 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 49 transitions. [2023-11-19 08:06:12,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 49 transitions. [2023-11-19 08:06:12,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-11-19 08:06:12,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.125) internal successors, (27), 27 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 11 states have return successors, (14), 11 states have call predecessors, (14), 6 states have call successors, (14) [2023-11-19 08:06:12,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2023-11-19 08:06:12,334 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 49 transitions. [2023-11-19 08:06:12,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 08:06:12,336 INFO L428 stractBuchiCegarLoop]: Abstraction has 43 states and 49 transitions. [2023-11-19 08:06:12,337 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-19 08:06:12,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 49 transitions. [2023-11-19 08:06:12,338 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-19 08:06:12,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:06:12,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:06:12,342 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 08:06:12,342 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:06:12,343 INFO L748 eck$LassoCheckResult]: Stem: 1959#$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); 1946#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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, main_~#d~0#1.base, main_~#d~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 main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1942#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 1943#$Ultimate##0 [2023-11-19 08:06:12,346 INFO L750 eck$LassoCheckResult]: Loop: 1943#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int(~a.base, ~a.offset, 4); 1945#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~b.base, ~b.offset, 4); 1932#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1933#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~b.base, ~b.offset, 4); 1953#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~c.base, ~c.offset, 4); 1936#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1947#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int(~c.base, ~c.offset, 4); 1934#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~d.base, ~d.offset, 4); 1937#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1950#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int(~d.base, ~d.offset, 4); 1960#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1950#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int(~d.base, ~d.offset, 4); 1960#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1950#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int(~d.base, ~d.offset, 4); 1960#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1950#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int(~d.base, ~d.offset, 4); 1960#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1950#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int(~d.base, ~d.offset, 4); 1960#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1950#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int(~d.base, ~d.offset, 4); 1960#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1950#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int(~d.base, ~d.offset, 4); 1960#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1951#L25-1 assume true; 1952#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1955#L25-1 assume true; 1973#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1971#L25-1 assume true; 1970#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1969#L25-1 assume true; 1968#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1967#L25-1 assume true; 1966#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1965#L25-1 assume true; 1964#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1963#L25-1 assume true; 1962#func_to_recursive_line_25_to_25_0EXIT >#80#return; 1956#L47-1 call #t~mem8 := read~int(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 1935#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1947#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int(~c.base, ~c.offset, 4); 1934#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1938#L41-1 assume true; 1954#func_to_recursive_line_24_to_25_0EXIT >#82#return; 1958#L41-1 assume true; 1972#func_to_recursive_line_24_to_25_0EXIT >#84#return; 1957#L67-1 call #t~mem11 := read~int(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 1931#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1933#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~b.base, ~b.offset, 4); 1953#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1939#L61-1 assume true; 1940#func_to_recursive_line_23_to_24_0EXIT >#86#return; 1944#L61-1 assume true; 1961#func_to_recursive_line_23_to_24_0EXIT >#88#return; 1948#L87-1 call #t~mem14 := read~int(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 1941#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 1943#$Ultimate##0 [2023-11-19 08:06:12,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:12,348 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 7 times [2023-11-19 08:06:12,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:12,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640884846] [2023-11-19 08:06:12,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:12,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:06:12,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:06:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:06:12,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:06:12,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:12,375 INFO L85 PathProgramCache]: Analyzing trace with hash -826587997, now seen corresponding path program 4 times [2023-11-19 08:06:12,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:12,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88639024] [2023-11-19 08:06:12,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:12,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:06:12,416 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:06:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:06:12,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:06:12,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:12,488 INFO L85 PathProgramCache]: Analyzing trace with hash -75483254, now seen corresponding path program 1 times [2023-11-19 08:06:12,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:06:12,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986324342] [2023-11-19 08:06:12,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:12,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:06:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:13,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 08:06:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:13,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:06:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:14,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:06:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:14,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:06:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:15,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:06:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:15,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:06:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:15,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:06:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:15,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:06:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:15,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:06:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:15,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 08:06:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:15,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-19 08:06:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:15,698 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2023-11-19 08:06:15,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:06:15,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986324342] [2023-11-19 08:06:15,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986324342] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:06:15,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043416261] [2023-11-19 08:06:15,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:15,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:06:15,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:06:15,703 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:06:15,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ca0e1d-8cc1-4351-a4c8-173573ca72bb/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 08:06:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:15,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-19 08:06:15,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:06:15,974 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 08:06:15,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 69 [2023-11-19 08:06:16,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 08:06:28,545 WARN L854 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_47|))))) is different from false [2023-11-19 08:06:40,552 WARN L876 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_47|))))) is different from true