./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61e5d6e-abd2-476c-b494-8bbb62a0d7a3/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61e5d6e-abd2-476c-b494-8bbb62a0d7a3/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61e5d6e-abd2-476c-b494-8bbb62a0d7a3/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61e5d6e-abd2-476c-b494-8bbb62a0d7a3/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61e5d6e-abd2-476c-b494-8bbb62a0d7a3/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61e5d6e-abd2-476c-b494-8bbb62a0d7a3/bin/uautomizer-verify-4GaUIPS5ZU --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 64bit --witnessprinter.graph.data.programhash e23f623e36810418f8259db464ff0229ef2650c877ad54b7024836b278c00de1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:14:52,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:14:52,439 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61e5d6e-abd2-476c-b494-8bbb62a0d7a3/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-31 22:14:52,448 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:14:52,448 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:14:52,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:14:52,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:14:52,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:14:52,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:14:52,489 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:14:52,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:14:52,491 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:14:52,491 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:14:52,493 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-31 22:14:52,494 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-31 22:14:52,494 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-31 22:14:52,494 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-31 22:14:52,495 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-31 22:14:52,499 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-31 22:14:52,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:14:52,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-31 22:14:52,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:14:52,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:14:52,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-31 22:14:52,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-31 22:14:52,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-31 22:14:52,502 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:14:52,502 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:14:52,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:14:52,503 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-31 22:14:52,503 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:14:52,504 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:14:52,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:14:52,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:14:52,505 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:14:52,506 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-31 22:14:52,506 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_f61e5d6e-abd2-476c-b494-8bbb62a0d7a3/bin/uautomizer-verify-4GaUIPS5ZU/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_f61e5d6e-abd2-476c-b494-8bbb62a0d7a3/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e23f623e36810418f8259db464ff0229ef2650c877ad54b7024836b278c00de1 [2024-10-31 22:14:52,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:14:52,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:14:52,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:14:52,865 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:14:52,866 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:14:52,867 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61e5d6e-abd2-476c-b494-8bbb62a0d7a3/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i Unable to find full path for "g++" [2024-10-31 22:14:55,087 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:14:55,359 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:14:55,360 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61e5d6e-abd2-476c-b494-8bbb62a0d7a3/sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i [2024-10-31 22:14:55,372 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61e5d6e-abd2-476c-b494-8bbb62a0d7a3/bin/uautomizer-verify-4GaUIPS5ZU/data/78c3f88aa/4c811a1dc7b74bf58bc35b57eab8d1fe/FLAG4ef4e487a [2024-10-31 22:14:55,389 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61e5d6e-abd2-476c-b494-8bbb62a0d7a3/bin/uautomizer-verify-4GaUIPS5ZU/data/78c3f88aa/4c811a1dc7b74bf58bc35b57eab8d1fe [2024-10-31 22:14:55,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:14:55,394 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:14:55,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:14:55,400 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:14:55,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:14:55,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:14:55" (1/1) ... [2024-10-31 22:14:55,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@181784c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:55, skipping insertion in model container [2024-10-31 22:14:55,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:14:55" (1/1) ... [2024-10-31 22:14:55,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:14:55,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:14:55,913 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:14:55,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:14:56,010 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:14:56,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:56 WrapperNode [2024-10-31 22:14:56,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:14:56,012 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:14:56,013 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:14:56,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:14:56,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:56" (1/1) ... [2024-10-31 22:14:56,039 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:56" (1/1) ... [2024-10-31 22:14:56,065 INFO L138 Inliner]: procedures = 109, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2024-10-31 22:14:56,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:14:56,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:14:56,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:14:56,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:14:56,081 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:56" (1/1) ... [2024-10-31 22:14:56,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:56" (1/1) ... [2024-10-31 22:14:56,084 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:56" (1/1) ... [2024-10-31 22:14:56,102 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [4, 6, 4]. 43 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 7 writes are split as follows [2, 3, 2]. [2024-10-31 22:14:56,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:56" (1/1) ... [2024-10-31 22:14:56,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:56" (1/1) ... [2024-10-31 22:14:56,110 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:56" (1/1) ... [2024-10-31 22:14:56,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:56" (1/1) ... [2024-10-31 22:14:56,122 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:56" (1/1) ... [2024-10-31 22:14:56,123 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:56" (1/1) ... [2024-10-31 22:14:56,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:14:56,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:14:56,130 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:14:56,130 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:14:56,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:56" (1/1) ... [2024-10-31 22:14:56,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:14:56,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61e5d6e-abd2-476c-b494-8bbb62a0d7a3/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:14:56,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61e5d6e-abd2-476c-b494-8bbb62a0d7a3/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:14:56,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61e5d6e-abd2-476c-b494-8bbb62a0d7a3/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-31 22:14:56,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 22:14:56,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 22:14:56,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-31 22:14:56,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:14:56,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:14:56,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-31 22:14:56,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-31 22:14:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 22:14:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:14:56,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:14:56,351 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:14:56,354 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:14:56,515 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-10-31 22:14:56,517 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:14:56,528 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:14:56,528 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-31 22:14:56,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:14:56 BoogieIcfgContainer [2024-10-31 22:14:56,529 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:14:56,530 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-31 22:14:56,530 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-31 22:14:56,535 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-31 22:14:56,535 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-31 22:14:56,536 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.10 10:14:55" (1/3) ... [2024-10-31 22:14:56,537 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1519ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.10 10:14:56, skipping insertion in model container [2024-10-31 22:14:56,537 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-31 22:14:56,537 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:56" (2/3) ... [2024-10-31 22:14:56,538 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1519ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.10 10:14:56, skipping insertion in model container [2024-10-31 22:14:56,538 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-31 22:14:56,538 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:14:56" (3/3) ... [2024-10-31 22:14:56,539 INFO L332 chiAutomizerObserver]: Analyzing ICFG java_Nested-alloca.i [2024-10-31 22:14:56,609 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-31 22:14:56,609 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-31 22:14:56,609 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-31 22:14:56,610 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-31 22:14:56,610 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-31 22:14:56,610 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-31 22:14:56,610 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-31 22:14:56,610 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-31 22:14:56,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:56,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-31 22:14:56,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:14:56,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:14:56,643 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:14:56,643 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-31 22:14:56,643 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-31 22:14:56,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:56,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-31 22:14:56,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:14:56,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:14:56,647 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:14:56,647 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-31 22:14:56,658 INFO L745 eck$LassoCheckResult]: Stem: 8#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#2(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 4#L552-4true [2024-10-31 22:14:56,659 INFO L747 eck$LassoCheckResult]: Loop: 4#L552-4true call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 12#L552-1true assume !!(main_#t~mem5#1 < 10);havoc main_#t~mem5#1;call write~int#1(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 11#L553-4true assume !true; 3#L552-3true call main_#t~mem10#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post11#1 := main_#t~mem10#1;call write~int#0(1 + main_#t~post11#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~post11#1; 4#L552-4true [2024-10-31 22:14:56,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:56,665 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-31 22:14:56,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:56,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388665214] [2024-10-31 22:14:56,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:56,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:14:56,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:14:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:14:56,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:14:56,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:56,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1113608, now seen corresponding path program 1 times [2024-10-31 22:14:56,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:56,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257151633] [2024-10-31 22:14:56,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:56,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:57,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:14:57,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:57,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257151633] [2024-10-31 22:14:57,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257151633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:57,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:57,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:14:57,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796969363] [2024-10-31 22:14:57,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:57,056 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:14:57,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:57,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:14:57,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:14:57,087 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:57,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:57,093 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2024-10-31 22:14:57,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2024-10-31 22:14:57,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-31 22:14:57,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 9 transitions. [2024-10-31 22:14:57,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-31 22:14:57,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-31 22:14:57,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2024-10-31 22:14:57,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:14:57,102 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2024-10-31 22:14:57,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2024-10-31 22:14:57,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-10-31 22:14:57,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:57,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2024-10-31 22:14:57,131 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2024-10-31 22:14:57,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:14:57,136 INFO L425 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2024-10-31 22:14:57,136 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-31 22:14:57,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2024-10-31 22:14:57,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-31 22:14:57,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:14:57,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:14:57,138 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:14:57,138 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-31 22:14:57,138 INFO L745 eck$LassoCheckResult]: Stem: 37#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 38#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#2(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 33#L552-4 [2024-10-31 22:14:57,138 INFO L747 eck$LassoCheckResult]: Loop: 33#L552-4 call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 34#L552-1 assume !!(main_#t~mem5#1 < 10);havoc main_#t~mem5#1;call write~int#1(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 36#L553-4 call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4); 39#L553-1 assume !(main_#t~mem6#1 < 12);havoc main_#t~mem6#1; 32#L552-3 call main_#t~mem10#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post11#1 := main_#t~mem10#1;call write~int#0(1 + main_#t~post11#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~post11#1; 33#L552-4 [2024-10-31 22:14:57,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:57,140 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-31 22:14:57,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:57,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938119247] [2024-10-31 22:14:57,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:57,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:14:57,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:14:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:14:57,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:14:57,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:57,227 INFO L85 PathProgramCache]: Analyzing trace with hash 34512977, now seen corresponding path program 1 times [2024-10-31 22:14:57,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:57,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035862130] [2024-10-31 22:14:57,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:57,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:57,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:14:57,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:57,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035862130] [2024-10-31 22:14:57,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035862130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:57,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:57,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:14:57,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374853319] [2024-10-31 22:14:57,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:57,429 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:14:57,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:57,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:14:57,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:14:57,431 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:57,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:57,484 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2024-10-31 22:14:57,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2024-10-31 22:14:57,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-31 22:14:57,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2024-10-31 22:14:57,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-31 22:14:57,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-31 22:14:57,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2024-10-31 22:14:57,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:14:57,487 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-10-31 22:14:57,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2024-10-31 22:14:57,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-10-31 22:14:57,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:57,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2024-10-31 22:14:57,489 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-10-31 22:14:57,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:14:57,491 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-10-31 22:14:57,491 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-31 22:14:57,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2024-10-31 22:14:57,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-31 22:14:57,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:14:57,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:14:57,493 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:14:57,494 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:57,494 INFO L745 eck$LassoCheckResult]: Stem: 64#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 65#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#2(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 60#L552-4 [2024-10-31 22:14:57,495 INFO L747 eck$LassoCheckResult]: Loop: 60#L552-4 call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 61#L552-1 assume !!(main_#t~mem5#1 < 10);havoc main_#t~mem5#1;call write~int#1(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 67#L553-4 call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4); 66#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 62#L553-3 call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 63#L553-4 call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4); 68#L553-1 assume !(main_#t~mem6#1 < 12);havoc main_#t~mem6#1; 59#L552-3 call main_#t~mem10#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post11#1 := main_#t~mem10#1;call write~int#0(1 + main_#t~post11#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~post11#1; 60#L552-4 [2024-10-31 22:14:57,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:57,496 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-31 22:14:57,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:57,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472034019] [2024-10-31 22:14:57,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:57,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:14:57,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:14:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:14:57,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:14:57,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:57,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1680656940, now seen corresponding path program 1 times [2024-10-31 22:14:57,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:57,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145089456] [2024-10-31 22:14:57,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:57,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:58,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:14:58,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:58,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145089456] [2024-10-31 22:14:58,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145089456] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:14:58,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525596766] [2024-10-31 22:14:58,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:58,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:14:58,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61e5d6e-abd2-476c-b494-8bbb62a0d7a3/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:14:58,068 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61e5d6e-abd2-476c-b494-8bbb62a0d7a3/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:14:58,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61e5d6e-abd2-476c-b494-8bbb62a0d7a3/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:14:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:58,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-31 22:14:58,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:14:58,259 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 [2024-10-31 22:14:58,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-31 22:14:58,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-31 22:14:58,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-31 22:14:58,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:14:58,364 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:14:58,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:14:58,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525596766] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:14:58,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:14:58,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2024-10-31 22:14:58,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121868709] [2024-10-31 22:14:58,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:14:58,472 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:14:58,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:58,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 22:14:58,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:14:58,473 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:58,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:58,603 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2024-10-31 22:14:58,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions. [2024-10-31 22:14:58,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2024-10-31 22:14:58,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 21 transitions. [2024-10-31 22:14:58,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-10-31 22:14:58,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-10-31 22:14:58,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2024-10-31 22:14:58,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:14:58,606 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-10-31 22:14:58,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2024-10-31 22:14:58,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2024-10-31 22:14:58,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:58,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2024-10-31 22:14:58,613 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 20 transitions. [2024-10-31 22:14:58,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-31 22:14:58,615 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2024-10-31 22:14:58,615 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-31 22:14:58,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2024-10-31 22:14:58,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-10-31 22:14:58,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:14:58,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:14:58,616 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:14:58,616 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 4, 1, 1, 1, 1] [2024-10-31 22:14:58,617 INFO L745 eck$LassoCheckResult]: Stem: 157#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 158#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#2(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 153#L552-4 [2024-10-31 22:14:58,617 INFO L747 eck$LassoCheckResult]: Loop: 153#L552-4 call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 154#L552-1 assume !!(main_#t~mem5#1 < 10);havoc main_#t~mem5#1;call write~int#1(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 160#L553-4 call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4); 159#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 155#L553-3 call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 156#L553-4 call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4); 170#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 169#L553-3 call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 168#L553-4 call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4); 167#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 166#L553-3 call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 165#L553-4 call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4); 164#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 162#L553-3 call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 163#L553-4 call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4); 161#L553-1 assume !(main_#t~mem6#1 < 12);havoc main_#t~mem6#1; 152#L552-3 call main_#t~mem10#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post11#1 := main_#t~mem10#1;call write~int#0(1 + main_#t~post11#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~post11#1; 153#L552-4 [2024-10-31 22:14:58,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:58,621 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-10-31 22:14:58,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:58,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414343257] [2024-10-31 22:14:58,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:58,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:14:58,645 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:14:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:14:58,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:14:58,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:58,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1241080977, now seen corresponding path program 2 times [2024-10-31 22:14:58,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:58,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329438237] [2024-10-31 22:14:58,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:58,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:59,738 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:14:59,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:59,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329438237] [2024-10-31 22:14:59,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329438237] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:14:59,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184812423] [2024-10-31 22:14:59,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-31 22:14:59,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:14:59,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61e5d6e-abd2-476c-b494-8bbb62a0d7a3/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:14:59,748 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61e5d6e-abd2-476c-b494-8bbb62a0d7a3/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:14:59,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f61e5d6e-abd2-476c-b494-8bbb62a0d7a3/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-31 22:14:59,860 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-31 22:14:59,860 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-31 22:14:59,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-31 22:14:59,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:14:59,880 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 [2024-10-31 22:14:59,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-31 22:14:59,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-31 22:14:59,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-31 22:14:59,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-31 22:14:59,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-31 22:15:00,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-31 22:15:00,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-31 22:15:00,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-31 22:15:00,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-31 22:15:00,061 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:15:00,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:15:00,267 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:15:00,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184812423] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:15:00,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:15:00,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 19 [2024-10-31 22:15:00,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178863579] [2024-10-31 22:15:00,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:15:00,269 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:15:00,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:00,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-31 22:15:00,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2024-10-31 22:15:00,276 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 2 Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:15:00,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:00,530 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2024-10-31 22:15:00,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 36 transitions. [2024-10-31 22:15:00,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2024-10-31 22:15:00,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 36 transitions. [2024-10-31 22:15:00,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2024-10-31 22:15:00,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2024-10-31 22:15:00,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 36 transitions. [2024-10-31 22:15:00,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:15:00,533 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-10-31 22:15:00,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 36 transitions. [2024-10-31 22:15:00,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-10-31 22:15:00,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:15:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-10-31 22:15:00,539 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-10-31 22:15:00,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-31 22:15:00,542 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-10-31 22:15:00,542 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-31 22:15:00,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 35 transitions. [2024-10-31 22:15:00,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2024-10-31 22:15:00,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:15:00,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:15:00,546 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:15:00,547 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 9, 9, 1, 1, 1, 1] [2024-10-31 22:15:00,547 INFO L745 eck$LassoCheckResult]: Stem: 341#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 342#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#2(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 337#L552-4 [2024-10-31 22:15:00,547 INFO L747 eck$LassoCheckResult]: Loop: 337#L552-4 call main_#t~mem5#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4); 338#L552-1 assume !!(main_#t~mem5#1 < 10);havoc main_#t~mem5#1;call write~int#1(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 344#L553-4 call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4); 343#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 339#L553-3 call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 340#L553-4 call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4); 369#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 368#L553-3 call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 367#L553-4 call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4); 366#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 365#L553-3 call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 364#L553-4 call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4); 363#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 362#L553-3 call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 361#L553-4 call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4); 360#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 359#L553-3 call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 358#L553-4 call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4); 357#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 356#L553-3 call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 355#L553-4 call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4); 354#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 353#L553-3 call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 352#L553-4 call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4); 351#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 350#L553-3 call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 349#L553-4 call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4); 348#L553-1 assume !!(main_#t~mem6#1 < 12);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(main_#t~mem7#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#2(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 346#L553-3 call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(2 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 347#L553-4 call main_#t~mem6#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4); 345#L553-1 assume !(main_#t~mem6#1 < 12);havoc main_#t~mem6#1; 336#L552-3 call main_#t~mem10#1 := read~int#0(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post11#1 := main_#t~mem10#1;call write~int#0(1 + main_#t~post11#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~post11#1; 337#L552-4 [2024-10-31 22:15:00,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:00,548 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-10-31 22:15:00,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:00,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296260808] [2024-10-31 22:15:00,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:00,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:00,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:15:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:00,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:15:00,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:00,583 INFO L85 PathProgramCache]: Analyzing trace with hash 778359212, now seen corresponding path program 3 times [2024-10-31 22:15:00,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:00,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906078924] [2024-10-31 22:15:00,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:00,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:00,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:15:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:00,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:15:00,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:00,677 INFO L85 PathProgramCache]: Analyzing trace with hash 320163182, now seen corresponding path program 1 times [2024-10-31 22:15:00,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:00,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316856518] [2024-10-31 22:15:00,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:00,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:00,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:15:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:00,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace