./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:12:49,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:12:49,598 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 13:12:49,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:12:49,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:12:49,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:12:49,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:12:49,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:12:49,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:12:49,674 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:12:49,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:12:49,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:12:49,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:12:49,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:12:49,674 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:12:49,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:12:49,675 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:12:49,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:12:49,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:12:49,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:12:49,675 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 13:12:49,675 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 13:12:49,675 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 13:12:49,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:12:49,676 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:12:49,676 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:12:49,676 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 13:12:49,676 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:12:49,676 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:12:49,676 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:12:49,676 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:12:49,676 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:12:49,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:12:49,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:12:49,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:12:49,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:12:49,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:12:49,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:12:49,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:12:49,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:12:49,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:12:49,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:12:49,684 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd 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(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 [2024-11-13 13:12:50,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:12:50,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:12:50,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:12:50,075 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:12:50,075 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:12:50,078 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i Unable to find full path for "g++" [2024-11-13 13:12:52,000 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:12:52,301 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:12:52,302 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2024-11-13 13:12:52,324 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/data/7d847bb32/ddc24c2d9a1f45668a58a69dc3293ae6/FLAGa3a550167 [2024-11-13 13:12:52,339 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/data/7d847bb32/ddc24c2d9a1f45668a58a69dc3293ae6 [2024-11-13 13:12:52,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:12:52,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:12:52,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:12:52,349 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:12:52,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:12:52,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:12:52" (1/1) ... [2024-11-13 13:12:52,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@464d5c9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:52, skipping insertion in model container [2024-11-13 13:12:52,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:12:52" (1/1) ... [2024-11-13 13:12:52,401 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:12:52,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:12:52,725 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:12:52,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:12:52,819 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:12:52,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:52 WrapperNode [2024-11-13 13:12:52,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:12:52,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:12:52,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:12:52,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:12:52,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:52" (1/1) ... [2024-11-13 13:12:52,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:52" (1/1) ... [2024-11-13 13:12:52,881 INFO L138 Inliner]: procedures = 119, calls = 46, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 150 [2024-11-13 13:12:52,885 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:12:52,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:12:52,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:12:52,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:12:52,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:52" (1/1) ... [2024-11-13 13:12:52,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:52" (1/1) ... [2024-11-13 13:12:52,902 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:52" (1/1) ... [2024-11-13 13:12:52,930 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [2, 27]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 12 writes are split as follows [0, 12]. [2024-11-13 13:12:52,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:52" (1/1) ... [2024-11-13 13:12:52,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:52" (1/1) ... [2024-11-13 13:12:52,945 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:52" (1/1) ... [2024-11-13 13:12:52,953 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:52" (1/1) ... [2024-11-13 13:12:52,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:52" (1/1) ... [2024-11-13 13:12:52,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:52" (1/1) ... [2024-11-13 13:12:52,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:12:52,964 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:12:52,967 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:12:52,967 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:12:52,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:52" (1/1) ... [2024-11-13 13:12:52,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:12:52,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:12:53,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:12:53,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:12:53,040 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-13 13:12:53,041 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-13 13:12:53,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 13:12:53,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 13:12:53,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 13:12:53,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 13:12:53,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 13:12:53,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:12:53,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 13:12:53,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 13:12:53,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 13:12:53,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 13:12:53,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 13:12:53,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:12:53,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 13:12:53,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:12:53,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:12:53,160 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:12:53,161 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:12:53,730 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-11-13 13:12:53,731 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:12:53,752 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:12:53,755 INFO L316 CfgBuilder]: Removed 17 assume(true) statements. [2024-11-13 13:12:53,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:12:53 BoogieIcfgContainer [2024-11-13 13:12:53,755 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:12:53,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:12:53,759 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:12:53,765 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:12:53,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:12:52" (1/3) ... [2024-11-13 13:12:53,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a03b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:12:53, skipping insertion in model container [2024-11-13 13:12:53,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:52" (2/3) ... [2024-11-13 13:12:53,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a03b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:12:53, skipping insertion in model container [2024-11-13 13:12:53,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:12:53" (3/3) ... [2024-11-13 13:12:53,770 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2024-11-13 13:12:53,786 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:12:53,788 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-rb-cnstr_1-1.i that has 2 procedures, 161 locations, 1 initial locations, 10 loop locations, and 65 error locations. [2024-11-13 13:12:53,837 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:12:53,866 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4940a1a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:12:53,867 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2024-11-13 13:12:53,872 INFO L276 IsEmpty]: Start isEmpty. Operand has 161 states, 87 states have (on average 2.103448275862069) internal successors, (183), 152 states have internal predecessors, (183), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-13 13:12:53,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 13:12:53,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:53,878 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-13 13:12:53,879 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:12:53,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:53,884 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-13 13:12:53,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:53,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984354441] [2024-11-13 13:12:53,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:53,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:54,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:54,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:54,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984354441] [2024-11-13 13:12:54,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984354441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:54,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:54,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:12:54,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166432635] [2024-11-13 13:12:54,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:54,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:12:54,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:54,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:12:54,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:12:54,146 INFO L87 Difference]: Start difference. First operand has 161 states, 87 states have (on average 2.103448275862069) internal successors, (183), 152 states have internal predecessors, (183), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-13 13:12:54,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:54,406 INFO L93 Difference]: Finished difference Result 147 states and 160 transitions. [2024-11-13 13:12:54,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:12:54,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) Word has length 3 [2024-11-13 13:12:54,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:54,416 INFO L225 Difference]: With dead ends: 147 [2024-11-13 13:12:54,416 INFO L226 Difference]: Without dead ends: 145 [2024-11-13 13:12:54,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:12:54,421 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 117 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:54,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 101 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:12:54,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-13 13:12:54,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-13 13:12:54,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 80 states have (on average 1.8875) internal successors, (151), 143 states have internal predecessors, (151), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:54,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2024-11-13 13:12:54,462 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 3 [2024-11-13 13:12:54,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:54,462 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2024-11-13 13:12:54,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-13 13:12:54,463 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2024-11-13 13:12:54,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 13:12:54,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:54,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-13 13:12:54,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:12:54,463 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:12:54,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:54,464 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-13 13:12:54,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:54,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153757953] [2024-11-13 13:12:54,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:54,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:54,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:54,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153757953] [2024-11-13 13:12:54,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153757953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:54,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:54,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:12:54,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377314033] [2024-11-13 13:12:54,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:54,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:12:54,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:54,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:12:54,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:12:54,575 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-13 13:12:54,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:54,745 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2024-11-13 13:12:54,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:12:54,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) Word has length 3 [2024-11-13 13:12:54,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:54,747 INFO L225 Difference]: With dead ends: 149 [2024-11-13 13:12:54,747 INFO L226 Difference]: Without dead ends: 149 [2024-11-13 13:12:54,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:12:54,748 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 111 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:54,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 112 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:12:54,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-13 13:12:54,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-13 13:12:54,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 87 states have (on average 1.7816091954022988) internal successors, (155), 147 states have internal predecessors, (155), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:54,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 162 transitions. [2024-11-13 13:12:54,756 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 162 transitions. Word has length 3 [2024-11-13 13:12:54,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:54,757 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 162 transitions. [2024-11-13 13:12:54,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-13 13:12:54,757 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 162 transitions. [2024-11-13 13:12:54,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 13:12:54,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:54,757 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:54,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:12:54,758 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:12:54,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:54,758 INFO L85 PathProgramCache]: Analyzing trace with hash 919163538, now seen corresponding path program 1 times [2024-11-13 13:12:54,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:54,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534166747] [2024-11-13 13:12:54,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:54,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:55,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:55,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:55,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534166747] [2024-11-13 13:12:55,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534166747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:55,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:55,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:12:55,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042945683] [2024-11-13 13:12:55,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:55,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:12:55,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:55,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:12:55,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:12:55,037 INFO L87 Difference]: Start difference. First operand 149 states and 162 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-11-13 13:12:55,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:55,333 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2024-11-13 13:12:55,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:12:55,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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) Word has length 9 [2024-11-13 13:12:55,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:55,335 INFO L225 Difference]: With dead ends: 136 [2024-11-13 13:12:55,336 INFO L226 Difference]: Without dead ends: 136 [2024-11-13 13:12:55,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:12:55,337 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 154 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:55,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 83 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:12:55,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-13 13:12:55,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-13 13:12:55,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 89 states have (on average 1.6179775280898876) internal successors, (144), 134 states have internal predecessors, (144), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:55,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 151 transitions. [2024-11-13 13:12:55,345 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 151 transitions. Word has length 9 [2024-11-13 13:12:55,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:55,345 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 151 transitions. [2024-11-13 13:12:55,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-11-13 13:12:55,345 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2024-11-13 13:12:55,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 13:12:55,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:55,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:55,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:12:55,346 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:12:55,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:55,347 INFO L85 PathProgramCache]: Analyzing trace with hash 919163539, now seen corresponding path program 1 times [2024-11-13 13:12:55,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:55,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206865300] [2024-11-13 13:12:55,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:55,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:55,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:55,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:55,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206865300] [2024-11-13 13:12:55,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206865300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:55,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:55,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:12:55,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25688425] [2024-11-13 13:12:55,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:55,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:12:55,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:55,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:12:55,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:12:55,612 INFO L87 Difference]: Start difference. First operand 136 states and 151 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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-11-13 13:12:55,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:55,989 INFO L93 Difference]: Finished difference Result 149 states and 165 transitions. [2024-11-13 13:12:55,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:12:55,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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) Word has length 9 [2024-11-13 13:12:55,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:55,991 INFO L225 Difference]: With dead ends: 149 [2024-11-13 13:12:55,994 INFO L226 Difference]: Without dead ends: 149 [2024-11-13 13:12:55,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:12:55,995 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 241 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:55,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 157 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:12:55,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-13 13:12:56,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2024-11-13 13:12:56,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 100 states have (on average 1.57) internal successors, (157), 144 states have internal predecessors, (157), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:56,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2024-11-13 13:12:56,005 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 9 [2024-11-13 13:12:56,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:56,005 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2024-11-13 13:12:56,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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-11-13 13:12:56,005 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2024-11-13 13:12:56,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 13:12:56,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:56,006 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:56,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:12:56,006 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:12:56,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:56,006 INFO L85 PathProgramCache]: Analyzing trace with hash 954402083, now seen corresponding path program 1 times [2024-11-13 13:12:56,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:56,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881451338] [2024-11-13 13:12:56,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:56,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:56,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:56,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881451338] [2024-11-13 13:12:56,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881451338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:56,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:56,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:12:56,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882623954] [2024-11-13 13:12:56,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:56,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:12:56,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:56,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:12:56,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:12:56,091 INFO L87 Difference]: Start difference. First operand 146 states and 164 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:56,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:56,290 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2024-11-13 13:12:56,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:12:56,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-13 13:12:56,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:56,292 INFO L225 Difference]: With dead ends: 152 [2024-11-13 13:12:56,292 INFO L226 Difference]: Without dead ends: 152 [2024-11-13 13:12:56,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:12:56,293 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 131 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:56,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 188 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:12:56,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-13 13:12:56,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 145. [2024-11-13 13:12:56,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 100 states have (on average 1.54) internal successors, (154), 143 states have internal predecessors, (154), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:56,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 160 transitions. [2024-11-13 13:12:56,310 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 160 transitions. Word has length 13 [2024-11-13 13:12:56,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:56,310 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 160 transitions. [2024-11-13 13:12:56,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:56,310 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 160 transitions. [2024-11-13 13:12:56,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 13:12:56,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:56,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:56,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 13:12:56,311 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:12:56,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:56,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1910514731, now seen corresponding path program 1 times [2024-11-13 13:12:56,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:56,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793261833] [2024-11-13 13:12:56,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:56,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:56,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:56,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793261833] [2024-11-13 13:12:56,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793261833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:56,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:56,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:12:56,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877139213] [2024-11-13 13:12:56,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:56,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:12:56,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:56,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:12:56,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:12:56,483 INFO L87 Difference]: Start difference. First operand 145 states and 160 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-11-13 13:12:56,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:56,678 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2024-11-13 13:12:56,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:12:56,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) Word has length 12 [2024-11-13 13:12:56,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:56,684 INFO L225 Difference]: With dead ends: 144 [2024-11-13 13:12:56,684 INFO L226 Difference]: Without dead ends: 144 [2024-11-13 13:12:56,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:12:56,685 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 4 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:56,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 346 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:12:56,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-13 13:12:56,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-13 13:12:56,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 100 states have (on average 1.52) internal successors, (152), 142 states have internal predecessors, (152), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:56,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 158 transitions. [2024-11-13 13:12:56,699 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 158 transitions. Word has length 12 [2024-11-13 13:12:56,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:56,699 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 158 transitions. [2024-11-13 13:12:56,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-11-13 13:12:56,699 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2024-11-13 13:12:56,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 13:12:56,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:56,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:56,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 13:12:56,700 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:12:56,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:56,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1910514730, now seen corresponding path program 1 times [2024-11-13 13:12:56,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:56,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043612775] [2024-11-13 13:12:56,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:56,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:56,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:56,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:56,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043612775] [2024-11-13 13:12:56,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043612775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:56,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:56,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:12:56,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092432177] [2024-11-13 13:12:56,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:56,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:12:56,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:56,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:12:56,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:12:56,964 INFO L87 Difference]: Start difference. First operand 144 states and 158 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-11-13 13:12:57,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:57,191 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2024-11-13 13:12:57,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:12:57,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) Word has length 12 [2024-11-13 13:12:57,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:57,193 INFO L225 Difference]: With dead ends: 143 [2024-11-13 13:12:57,193 INFO L226 Difference]: Without dead ends: 143 [2024-11-13 13:12:57,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:12:57,195 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 2 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:57,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 331 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:12:57,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-13 13:12:57,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-13 13:12:57,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 100 states have (on average 1.5) internal successors, (150), 141 states have internal predecessors, (150), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 156 transitions. [2024-11-13 13:12:57,204 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 156 transitions. Word has length 12 [2024-11-13 13:12:57,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:57,204 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 156 transitions. [2024-11-13 13:12:57,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-11-13 13:12:57,204 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2024-11-13 13:12:57,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 13:12:57,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:57,205 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:57,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 13:12:57,205 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:12:57,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:57,206 INFO L85 PathProgramCache]: Analyzing trace with hash -681502358, now seen corresponding path program 1 times [2024-11-13 13:12:57,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:57,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121076203] [2024-11-13 13:12:57,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:57,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:57,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:57,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:57,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121076203] [2024-11-13 13:12:57,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121076203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:57,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:57,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:12:57,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464685325] [2024-11-13 13:12:57,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:57,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:12:57,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:57,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:12:57,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:12:57,420 INFO L87 Difference]: Start difference. First operand 143 states and 156 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:57,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:57,679 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2024-11-13 13:12:57,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:12:57,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-13 13:12:57,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:57,681 INFO L225 Difference]: With dead ends: 183 [2024-11-13 13:12:57,681 INFO L226 Difference]: Without dead ends: 183 [2024-11-13 13:12:57,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:12:57,682 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 204 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:57,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 334 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:12:57,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-13 13:12:57,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 148. [2024-11-13 13:12:57,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 105 states have (on average 1.4761904761904763) internal successors, (155), 146 states have internal predecessors, (155), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:57,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 161 transitions. [2024-11-13 13:12:57,695 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 161 transitions. Word has length 16 [2024-11-13 13:12:57,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:57,695 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 161 transitions. [2024-11-13 13:12:57,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:57,695 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 161 transitions. [2024-11-13 13:12:57,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 13:12:57,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:57,696 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:57,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 13:12:57,696 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:12:57,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:57,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2139547560, now seen corresponding path program 1 times [2024-11-13 13:12:57,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:57,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180893513] [2024-11-13 13:12:57,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:57,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:58,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:58,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:58,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180893513] [2024-11-13 13:12:58,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180893513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:58,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:58,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 13:12:58,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119694676] [2024-11-13 13:12:58,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:58,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 13:12:58,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:58,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 13:12:58,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-13 13:12:58,229 INFO L87 Difference]: Start difference. First operand 148 states and 161 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:59,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:59,010 INFO L93 Difference]: Finished difference Result 162 states and 179 transitions. [2024-11-13 13:12:59,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:12:59,011 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-13 13:12:59,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:59,012 INFO L225 Difference]: With dead ends: 162 [2024-11-13 13:12:59,012 INFO L226 Difference]: Without dead ends: 162 [2024-11-13 13:12:59,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-11-13 13:12:59,013 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 194 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:59,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 354 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:12:59,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-13 13:12:59,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 152. [2024-11-13 13:12:59,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 115 states have (on average 1.4173913043478261) internal successors, (163), 150 states have internal predecessors, (163), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:59,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 169 transitions. [2024-11-13 13:12:59,020 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 169 transitions. Word has length 16 [2024-11-13 13:12:59,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:59,021 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 169 transitions. [2024-11-13 13:12:59,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:59,021 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 169 transitions. [2024-11-13 13:12:59,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 13:12:59,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:59,022 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:59,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 13:12:59,023 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:12:59,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:59,023 INFO L85 PathProgramCache]: Analyzing trace with hash -2139547561, now seen corresponding path program 1 times [2024-11-13 13:12:59,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:59,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534111606] [2024-11-13 13:12:59,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:59,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:59,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:59,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:59,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534111606] [2024-11-13 13:12:59,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534111606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:59,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:59,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:12:59,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722642021] [2024-11-13 13:12:59,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:59,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:12:59,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:59,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:12:59,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:12:59,325 INFO L87 Difference]: Start difference. First operand 152 states and 169 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:59,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:59,821 INFO L93 Difference]: Finished difference Result 151 states and 168 transitions. [2024-11-13 13:12:59,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:12:59,822 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-13 13:12:59,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:59,823 INFO L225 Difference]: With dead ends: 151 [2024-11-13 13:12:59,823 INFO L226 Difference]: Without dead ends: 151 [2024-11-13 13:12:59,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-13 13:12:59,823 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 141 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:59,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 288 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:12:59,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-13 13:12:59,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-11-13 13:12:59,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 149 states have internal predecessors, (162), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:59,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 168 transitions. [2024-11-13 13:12:59,828 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 168 transitions. Word has length 16 [2024-11-13 13:12:59,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:59,829 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 168 transitions. [2024-11-13 13:12:59,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:59,829 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 168 transitions. [2024-11-13 13:12:59,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 13:12:59,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:59,830 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:59,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 13:12:59,830 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:12:59,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:59,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1072257331, now seen corresponding path program 1 times [2024-11-13 13:12:59,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:59,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780298841] [2024-11-13 13:12:59,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:59,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:00,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:00,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:00,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780298841] [2024-11-13 13:13:00,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780298841] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:13:00,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611282954] [2024-11-13 13:13:00,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:00,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:00,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:13:00,149 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:13:00,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:13:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:00,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 13:13:00,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:13:00,339 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-11-13 13:13:00,348 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-11-13 13:13:00,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 13:13:00,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-13 13:13:00,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 13:13:00,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 13:13:00,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:00,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:13:01,237 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 10 treesize of output 8 [2024-11-13 13:13:01,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-13 13:13:01,260 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 10 treesize of output 8 [2024-11-13 13:13:01,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:01,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:01,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611282954] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:13:01,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:13:01,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 13 [2024-11-13 13:13:01,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914889284] [2024-11-13 13:13:01,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:13:01,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 13:13:01,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:01,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 13:13:01,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-13 13:13:01,291 INFO L87 Difference]: Start difference. First operand 151 states and 168 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:01,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:01,890 INFO L93 Difference]: Finished difference Result 189 states and 212 transitions. [2024-11-13 13:13:01,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 13:13:01,891 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-13 13:13:01,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:01,892 INFO L225 Difference]: With dead ends: 189 [2024-11-13 13:13:01,892 INFO L226 Difference]: Without dead ends: 189 [2024-11-13 13:13:01,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-11-13 13:13:01,893 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 178 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:01,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 567 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:13:01,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-13 13:13:01,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 158. [2024-11-13 13:13:01,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 122 states have (on average 1.3934426229508197) internal successors, (170), 156 states have internal predecessors, (170), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:01,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 176 transitions. [2024-11-13 13:13:01,900 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 176 transitions. Word has length 21 [2024-11-13 13:13:01,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:01,900 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 176 transitions. [2024-11-13 13:13:01,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:01,900 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 176 transitions. [2024-11-13 13:13:01,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 13:13:01,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:01,901 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:01,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 13:13:02,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-13 13:13:02,102 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:13:02,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:02,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1872644597, now seen corresponding path program 1 times [2024-11-13 13:13:02,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:02,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987731279] [2024-11-13 13:13:02,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:02,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:02,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:02,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:02,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987731279] [2024-11-13 13:13:02,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987731279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:02,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:02,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:13:02,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316726831] [2024-11-13 13:13:02,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:02,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:13:02,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:02,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:13:02,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:13:02,181 INFO L87 Difference]: Start difference. First operand 158 states and 176 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-11-13 13:13:02,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:02,386 INFO L93 Difference]: Finished difference Result 161 states and 177 transitions. [2024-11-13 13:13:02,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:13:02,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) Word has length 22 [2024-11-13 13:13:02,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:02,388 INFO L225 Difference]: With dead ends: 161 [2024-11-13 13:13:02,388 INFO L226 Difference]: Without dead ends: 161 [2024-11-13 13:13:02,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:13:02,389 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 18 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:02,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 335 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:13:02,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-13 13:13:02,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2024-11-13 13:13:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 121 states have (on average 1.3801652892561984) internal successors, (167), 155 states have internal predecessors, (167), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:02,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 173 transitions. [2024-11-13 13:13:02,396 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 173 transitions. Word has length 22 [2024-11-13 13:13:02,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:02,396 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 173 transitions. [2024-11-13 13:13:02,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-11-13 13:13:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 173 transitions. [2024-11-13 13:13:02,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 13:13:02,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:02,397 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:02,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 13:13:02,398 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:13:02,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:02,398 INFO L85 PathProgramCache]: Analyzing trace with hash 823561326, now seen corresponding path program 1 times [2024-11-13 13:13:02,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:02,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41389009] [2024-11-13 13:13:02,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:02,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:02,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:02,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:02,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41389009] [2024-11-13 13:13:02,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41389009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:02,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:02,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:13:02,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251246781] [2024-11-13 13:13:02,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:02,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:13:02,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:02,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:13:02,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:13:02,512 INFO L87 Difference]: Start difference. First operand 157 states and 173 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:02,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:02,662 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2024-11-13 13:13:02,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:13:02,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-13 13:13:02,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:02,664 INFO L225 Difference]: With dead ends: 160 [2024-11-13 13:13:02,664 INFO L226 Difference]: Without dead ends: 160 [2024-11-13 13:13:02,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:13:02,665 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 15 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:02,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 286 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:13:02,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-13 13:13:02,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2024-11-13 13:13:02,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 121 states have (on average 1.3636363636363635) internal successors, (165), 154 states have internal predecessors, (165), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:02,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2024-11-13 13:13:02,674 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 24 [2024-11-13 13:13:02,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:02,675 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2024-11-13 13:13:02,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:02,675 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2024-11-13 13:13:02,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 13:13:02,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:02,677 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:02,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 13:13:02,678 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:13:02,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:02,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1085080456, now seen corresponding path program 1 times [2024-11-13 13:13:02,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:02,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103262335] [2024-11-13 13:13:02,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:02,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:02,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:02,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103262335] [2024-11-13 13:13:02,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103262335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:02,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:02,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:13:02,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338331836] [2024-11-13 13:13:02,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:02,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:13:02,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:02,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:13:02,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:13:02,816 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-11-13 13:13:02,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:02,999 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2024-11-13 13:13:03,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:13:03,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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) Word has length 24 [2024-11-13 13:13:03,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:03,001 INFO L225 Difference]: With dead ends: 155 [2024-11-13 13:13:03,001 INFO L226 Difference]: Without dead ends: 155 [2024-11-13 13:13:03,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:13:03,002 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 3 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:03,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 321 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:13:03,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-13 13:13:03,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-13 13:13:03,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 121 states have (on average 1.3553719008264462) internal successors, (164), 153 states have internal predecessors, (164), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:03,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 169 transitions. [2024-11-13 13:13:03,008 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 169 transitions. Word has length 24 [2024-11-13 13:13:03,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:03,008 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 169 transitions. [2024-11-13 13:13:03,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-11-13 13:13:03,008 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 169 transitions. [2024-11-13 13:13:03,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 13:13:03,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:03,013 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:03,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 13:13:03,013 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:13:03,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:03,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1085080457, now seen corresponding path program 1 times [2024-11-13 13:13:03,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:03,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839720206] [2024-11-13 13:13:03,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:03,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:03,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:03,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:03,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839720206] [2024-11-13 13:13:03,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839720206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:03,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:03,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:13:03,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993382357] [2024-11-13 13:13:03,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:03,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:13:03,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:03,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:13:03,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:13:03,255 INFO L87 Difference]: Start difference. First operand 155 states and 169 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-11-13 13:13:03,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:03,487 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2024-11-13 13:13:03,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:13:03,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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) Word has length 24 [2024-11-13 13:13:03,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:03,488 INFO L225 Difference]: With dead ends: 154 [2024-11-13 13:13:03,488 INFO L226 Difference]: Without dead ends: 154 [2024-11-13 13:13:03,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:13:03,489 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:03,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 311 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:13:03,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-13 13:13:03,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-13 13:13:03,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 121 states have (on average 1.3471074380165289) internal successors, (163), 152 states have internal predecessors, (163), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:03,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2024-11-13 13:13:03,496 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 24 [2024-11-13 13:13:03,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:03,497 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2024-11-13 13:13:03,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-11-13 13:13:03,497 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2024-11-13 13:13:03,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 13:13:03,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:03,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:03,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 13:13:03,499 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:13:03,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:03,500 INFO L85 PathProgramCache]: Analyzing trace with hash -301785554, now seen corresponding path program 1 times [2024-11-13 13:13:03,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:03,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873272157] [2024-11-13 13:13:03,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:03,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:03,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:03,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:03,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873272157] [2024-11-13 13:13:03,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873272157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:03,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:03,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:13:03,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630121909] [2024-11-13 13:13:03,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:03,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:13:03,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:03,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:13:03,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:13:03,702 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:03,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:03,834 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2024-11-13 13:13:03,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:13:03,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-13 13:13:03,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:03,835 INFO L225 Difference]: With dead ends: 154 [2024-11-13 13:13:03,835 INFO L226 Difference]: Without dead ends: 154 [2024-11-13 13:13:03,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:13:03,836 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 11 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:03,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 261 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:13:03,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-13 13:13:03,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2024-11-13 13:13:03,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 121 states have (on average 1.3305785123966942) internal successors, (161), 151 states have internal predecessors, (161), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2024-11-13 13:13:03,840 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 27 [2024-11-13 13:13:03,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:03,840 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2024-11-13 13:13:03,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:03,840 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2024-11-13 13:13:03,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 13:13:03,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:03,841 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:03,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 13:13:03,841 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:13:03,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:03,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1133425020, now seen corresponding path program 1 times [2024-11-13 13:13:03,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:03,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730815947] [2024-11-13 13:13:03,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:03,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:13:03,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:03,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730815947] [2024-11-13 13:13:03,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730815947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:03,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:03,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:13:03,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848569865] [2024-11-13 13:13:03,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:03,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:13:03,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:03,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:13:03,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:13:03,891 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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-11-13 13:13:03,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:03,952 INFO L93 Difference]: Finished difference Result 155 states and 167 transitions. [2024-11-13 13:13:03,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:13:03,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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) Word has length 27 [2024-11-13 13:13:03,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:03,953 INFO L225 Difference]: With dead ends: 155 [2024-11-13 13:13:03,953 INFO L226 Difference]: Without dead ends: 155 [2024-11-13 13:13:03,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:13:03,954 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 64 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:03,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 121 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:13:03,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-13 13:13:03,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-13 13:13:03,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 123 states have (on average 1.3252032520325203) internal successors, (163), 153 states have internal predecessors, (163), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:03,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 167 transitions. [2024-11-13 13:13:03,961 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 167 transitions. Word has length 27 [2024-11-13 13:13:03,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:03,961 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 167 transitions. [2024-11-13 13:13:03,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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-11-13 13:13:03,961 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 167 transitions. [2024-11-13 13:13:03,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 13:13:03,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:03,966 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:03,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 13:13:03,966 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:13:03,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:03,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1989507427, now seen corresponding path program 1 times [2024-11-13 13:13:03,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:03,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39278768] [2024-11-13 13:13:03,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:03,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:04,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:04,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:04,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39278768] [2024-11-13 13:13:04,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39278768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:04,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:04,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 13:13:04,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996534998] [2024-11-13 13:13:04,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:04,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 13:13:04,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:04,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 13:13:04,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-13 13:13:04,201 INFO L87 Difference]: Start difference. First operand 155 states and 167 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:04,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:04,753 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2024-11-13 13:13:04,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:13:04,754 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-13 13:13:04,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:04,754 INFO L225 Difference]: With dead ends: 162 [2024-11-13 13:13:04,755 INFO L226 Difference]: Without dead ends: 162 [2024-11-13 13:13:04,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-11-13 13:13:04,755 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 166 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:04,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 320 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:13:04,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-13 13:13:04,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 155. [2024-11-13 13:13:04,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 123 states have (on average 1.3170731707317074) internal successors, (162), 153 states have internal predecessors, (162), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:04,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 166 transitions. [2024-11-13 13:13:04,760 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 166 transitions. Word has length 29 [2024-11-13 13:13:04,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:04,761 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 166 transitions. [2024-11-13 13:13:04,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:04,761 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions. [2024-11-13 13:13:04,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 13:13:04,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:04,762 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:04,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 13:13:04,762 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:13:04,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:04,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1409531466, now seen corresponding path program 1 times [2024-11-13 13:13:04,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:04,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872683114] [2024-11-13 13:13:04,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:04,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:05,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:05,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872683114] [2024-11-13 13:13:05,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872683114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:05,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:05,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:13:05,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816906661] [2024-11-13 13:13:05,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:05,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:13:05,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:05,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:13:05,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:13:05,017 INFO L87 Difference]: Start difference. First operand 155 states and 166 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:05,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:05,354 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2024-11-13 13:13:05,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:13:05,355 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-13 13:13:05,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:05,355 INFO L225 Difference]: With dead ends: 155 [2024-11-13 13:13:05,356 INFO L226 Difference]: Without dead ends: 155 [2024-11-13 13:13:05,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:13:05,356 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 40 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:05,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 309 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:13:05,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-13 13:13:05,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2024-11-13 13:13:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 152 states have internal predecessors, (161), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 165 transitions. [2024-11-13 13:13:05,364 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 165 transitions. Word has length 28 [2024-11-13 13:13:05,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:05,364 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 165 transitions. [2024-11-13 13:13:05,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:05,365 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 165 transitions. [2024-11-13 13:13:05,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 13:13:05,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:05,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:05,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 13:13:05,365 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:13:05,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:05,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1409531467, now seen corresponding path program 1 times [2024-11-13 13:13:05,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:05,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032500447] [2024-11-13 13:13:05,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:05,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:05,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:05,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:05,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032500447] [2024-11-13 13:13:05,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032500447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:05,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:05,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:13:05,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587821728] [2024-11-13 13:13:05,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:05,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:13:05,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:05,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:13:05,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:13:05,757 INFO L87 Difference]: Start difference. First operand 154 states and 165 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:06,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:06,105 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2024-11-13 13:13:06,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:13:06,105 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-13 13:13:06,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:06,106 INFO L225 Difference]: With dead ends: 149 [2024-11-13 13:13:06,106 INFO L226 Difference]: Without dead ends: 149 [2024-11-13 13:13:06,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-13 13:13:06,107 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 57 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:06,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 358 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:13:06,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-13 13:13:06,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 138. [2024-11-13 13:13:06,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 114 states have (on average 1.263157894736842) internal successors, (144), 136 states have internal predecessors, (144), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:06,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2024-11-13 13:13:06,117 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 28 [2024-11-13 13:13:06,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:06,117 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2024-11-13 13:13:06,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:06,117 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2024-11-13 13:13:06,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 13:13:06,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:06,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:06,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 13:13:06,119 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:13:06,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:06,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1700239361, now seen corresponding path program 1 times [2024-11-13 13:13:06,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:06,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792182497] [2024-11-13 13:13:06,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:06,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:06,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:06,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:06,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792182497] [2024-11-13 13:13:06,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792182497] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:13:06,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335451951] [2024-11-13 13:13:06,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:06,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:06,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:13:06,255 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:13:06,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:13:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:06,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 13:13:06,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:13:06,393 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 19 treesize of output 1 [2024-11-13 13:13:06,441 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 19 treesize of output 7 [2024-11-13 13:13:06,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:13:06,456 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:13:06,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335451951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:06,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:13:06,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-11-13 13:13:06,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389519185] [2024-11-13 13:13:06,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:06,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:13:06,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:06,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:13:06,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-13 13:13:06,458 INFO L87 Difference]: Start difference. First operand 138 states and 148 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-11-13 13:13:06,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:06,546 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2024-11-13 13:13:06,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:13:06,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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) Word has length 29 [2024-11-13 13:13:06,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:06,548 INFO L225 Difference]: With dead ends: 145 [2024-11-13 13:13:06,548 INFO L226 Difference]: Without dead ends: 145 [2024-11-13 13:13:06,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:13:06,549 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 5 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:06,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 269 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:13:06,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-13 13:13:06,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2024-11-13 13:13:06,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 139 states have internal predecessors, (147), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:06,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2024-11-13 13:13:06,553 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 29 [2024-11-13 13:13:06,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:06,554 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2024-11-13 13:13:06,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-11-13 13:13:06,554 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2024-11-13 13:13:06,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 13:13:06,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:06,554 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2024-11-13 13:13:06,574 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 13:13:06,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:06,755 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:13:06,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:06,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1515355891, now seen corresponding path program 1 times [2024-11-13 13:13:06,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:06,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41129708] [2024-11-13 13:13:06,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:06,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:07,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:07,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:07,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41129708] [2024-11-13 13:13:07,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41129708] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:13:07,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291151462] [2024-11-13 13:13:07,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:07,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:07,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:13:07,010 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:13:07,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 13:13:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:07,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-13 13:13:07,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:13:07,137 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-11-13 13:13:07,143 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-11-13 13:13:07,154 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 27 treesize of output 11 [2024-11-13 13:13:07,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 13:13:07,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:07,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 23 [2024-11-13 13:13:07,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-13 13:13:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:13:07,418 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:13:07,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:13:07,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291151462] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:13:07,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:13:07,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 10 [2024-11-13 13:13:07,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015498655] [2024-11-13 13:13:07,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:13:07,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 13:13:07,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:07,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 13:13:07,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-13 13:13:07,583 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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-11-13 13:13:08,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:08,157 INFO L93 Difference]: Finished difference Result 163 states and 180 transitions. [2024-11-13 13:13:08,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:13:08,157 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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) Word has length 30 [2024-11-13 13:13:08,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:08,158 INFO L225 Difference]: With dead ends: 163 [2024-11-13 13:13:08,158 INFO L226 Difference]: Without dead ends: 163 [2024-11-13 13:13:08,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-11-13 13:13:08,160 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 16 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:08,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 530 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:13:08,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-13 13:13:08,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 152. [2024-11-13 13:13:08,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 128 states have (on average 1.25) internal successors, (160), 150 states have internal predecessors, (160), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:08,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2024-11-13 13:13:08,166 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 30 [2024-11-13 13:13:08,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:08,166 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2024-11-13 13:13:08,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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-11-13 13:13:08,166 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2024-11-13 13:13:08,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 13:13:08,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:08,167 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:08,190 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 13:13:08,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:08,368 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:13:08,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:08,368 INFO L85 PathProgramCache]: Analyzing trace with hash -268607987, now seen corresponding path program 1 times [2024-11-13 13:13:08,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:08,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346509136] [2024-11-13 13:13:08,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:08,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:08,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:13:08,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:08,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346509136] [2024-11-13 13:13:08,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346509136] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:13:08,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468896595] [2024-11-13 13:13:08,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:08,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:08,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:13:08,472 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:13:08,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 13:13:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:08,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 13:13:08,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:13:08,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2024-11-13 13:13:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:13:08,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:13:08,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:13:08,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468896595] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:13:08,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:13:08,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-11-13 13:13:08,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201735235] [2024-11-13 13:13:08,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:13:08,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:13:08,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:08,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:13:08,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:13:08,733 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 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-11-13 13:13:08,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:08,904 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2024-11-13 13:13:08,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:13:08,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 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) Word has length 31 [2024-11-13 13:13:08,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:08,905 INFO L225 Difference]: With dead ends: 160 [2024-11-13 13:13:08,905 INFO L226 Difference]: Without dead ends: 137 [2024-11-13 13:13:08,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:13:08,906 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:08,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:13:08,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-13 13:13:08,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-13 13:13:08,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 113 states have (on average 1.2743362831858407) internal successors, (144), 135 states have internal predecessors, (144), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:08,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2024-11-13 13:13:08,912 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 31 [2024-11-13 13:13:08,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:08,912 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2024-11-13 13:13:08,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 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-11-13 13:13:08,913 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2024-11-13 13:13:08,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 13:13:08,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:08,913 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:08,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-13 13:13:09,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:09,114 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:13:09,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:09,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1278929291, now seen corresponding path program 1 times [2024-11-13 13:13:09,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:09,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356066114] [2024-11-13 13:13:09,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:09,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:09,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:09,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:09,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356066114] [2024-11-13 13:13:09,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356066114] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:13:09,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065422066] [2024-11-13 13:13:09,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:09,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:09,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:13:09,757 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:13:09,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 13:13:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:09,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 13:13:09,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:13:09,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-13 13:13:09,938 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-11-13 13:13:09,998 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:13:09,998 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 11 treesize of output 11 [2024-11-13 13:13:10,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:10,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 13:13:10,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:13:10,109 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:13:10,110 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-13 13:13:10,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 13:13:10,149 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 16 treesize of output 8 [2024-11-13 13:13:10,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:13:10,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:13:10,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:10,290 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:13:10,476 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_901 (Array Int Int)) (v_ArrVal_904 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_901) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_902) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_904) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-13 13:13:10,485 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_901 (Array Int Int)) (v_ArrVal_904 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int#1| .cse0 v_ArrVal_901) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_902) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_904)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-13 13:13:10,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:10,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2024-11-13 13:13:10,505 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 70 treesize of output 62 [2024-11-13 13:13:10,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2024-11-13 13:13:19,021 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:19,025 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-13 13:13:19,025 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2024-11-13 13:13:19,031 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:19,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:19,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 46 [2024-11-13 13:13:19,045 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 165 treesize of output 141 [2024-11-13 13:13:19,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 13:13:27,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:27,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065422066] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:13:27,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:13:27,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 25 [2024-11-13 13:13:27,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274435803] [2024-11-13 13:13:27,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:13:27,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-13 13:13:27,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:27,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-13 13:13:27,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=407, Unknown=20, NotChecked=86, Total=600 [2024-11-13 13:13:27,094 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:29,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:29,528 INFO L93 Difference]: Finished difference Result 217 states and 237 transitions. [2024-11-13 13:13:29,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 13:13:29,529 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-13 13:13:29,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:29,530 INFO L225 Difference]: With dead ends: 217 [2024-11-13 13:13:29,530 INFO L226 Difference]: Without dead ends: 217 [2024-11-13 13:13:29,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=311, Invalid=1081, Unknown=22, NotChecked=146, Total=1560 [2024-11-13 13:13:29,531 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 589 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 60 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 380 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:29,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 651 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 986 Invalid, 10 Unknown, 380 Unchecked, 1.5s Time] [2024-11-13 13:13:29,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-13 13:13:29,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 163. [2024-11-13 13:13:29,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 139 states have (on average 1.2374100719424461) internal successors, (172), 161 states have internal predecessors, (172), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:29,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 176 transitions. [2024-11-13 13:13:29,537 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 176 transitions. Word has length 37 [2024-11-13 13:13:29,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:29,537 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 176 transitions. [2024-11-13 13:13:29,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:29,538 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 176 transitions. [2024-11-13 13:13:29,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 13:13:29,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:29,538 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:29,558 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 13:13:29,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:29,742 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:13:29,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:29,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1568897938, now seen corresponding path program 1 times [2024-11-13 13:13:29,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:29,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880361258] [2024-11-13 13:13:29,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:29,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:29,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:29,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:29,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880361258] [2024-11-13 13:13:29,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880361258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:29,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:29,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 13:13:29,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716963753] [2024-11-13 13:13:29,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:29,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:13:29,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:29,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:13:29,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:13:29,997 INFO L87 Difference]: Start difference. First operand 163 states and 176 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:30,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:30,311 INFO L93 Difference]: Finished difference Result 173 states and 186 transitions. [2024-11-13 13:13:30,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:13:30,311 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-13 13:13:30,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:30,312 INFO L225 Difference]: With dead ends: 173 [2024-11-13 13:13:30,312 INFO L226 Difference]: Without dead ends: 173 [2024-11-13 13:13:30,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-13 13:13:30,313 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 48 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:30,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 398 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:13:30,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-13 13:13:30,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 155. [2024-11-13 13:13:30,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 132 states have (on average 1.2424242424242424) internal successors, (164), 153 states have internal predecessors, (164), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:30,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 167 transitions. [2024-11-13 13:13:30,318 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 167 transitions. Word has length 39 [2024-11-13 13:13:30,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:30,318 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 167 transitions. [2024-11-13 13:13:30,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:30,318 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 167 transitions. [2024-11-13 13:13:30,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 13:13:30,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:30,319 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:30,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 13:13:30,319 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:13:30,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:30,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1983957768, now seen corresponding path program 1 times [2024-11-13 13:13:30,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:30,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914792999] [2024-11-13 13:13:30,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:30,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:31,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:31,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:31,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914792999] [2024-11-13 13:13:31,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914792999] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:13:31,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511923201] [2024-11-13 13:13:31,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:31,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:31,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:13:31,081 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:13:31,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 13:13:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:31,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-13 13:13:31,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:13:31,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-13 13:13:31,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-13 13:13:31,358 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:13:31,358 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 11 treesize of output 11 [2024-11-13 13:13:31,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:13:31,421 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-11-13 13:13:31,602 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:13:31,602 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-13 13:13:31,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 13:13:31,763 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:13:31,763 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 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-13 13:13:31,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:31,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:13:31,830 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:13:31,830 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-13 13:13:31,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 13:13:32,141 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 25 treesize of output 13 [2024-11-13 13:13:32,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 13:13:32,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:32,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:13:32,840 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_87| Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1078 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_87| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_87|) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1078) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_87|) 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1079) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_87|))))) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_87| Int) (v_ArrVal_1078 (Array Int Int))) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1078) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_87|) 9)) (< |v_ULTIMATE.start_main_~end~0#1.offset_87| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_87|)))) is different from false [2024-11-13 13:13:32,952 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_87| Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1078 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_87| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_87|) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1078) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_87|) 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1079) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_87|))))) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_87| Int) (v_ArrVal_1078 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_87| 0) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1078) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_87|) 9)) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_87|)))) is different from false [2024-11-13 13:13:32,984 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_87| Int) (v_ArrVal_1078 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_87| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_87|) (< 0 (+ 9 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1078) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_87|))))) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_87| Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1078 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_87| 0) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1078) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_87|) 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1079) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_87|))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_87|))))) is different from false [2024-11-13 13:13:33,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:33,488 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-11-13 13:13:33,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:33,498 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-13 13:13:33,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:33,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 632 treesize of output 567 [2024-11-13 13:13:33,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:33,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1831 treesize of output 1742 [2024-11-13 13:13:33,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 547 treesize of output 523 [2024-11-13 13:13:33,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 523 treesize of output 499 [2024-11-13 13:13:33,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 499 treesize of output 491 [2024-11-13 13:13:33,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:33,730 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 491 treesize of output 447 [2024-11-13 13:13:34,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:34,937 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2024-11-13 13:13:34,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:34,950 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-11-13 13:13:34,955 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:34,959 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 28 treesize of output 20 [2024-11-13 13:13:34,964 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:34,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:34,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:34,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 13:13:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:35,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511923201] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:13:35,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:13:35,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 37 [2024-11-13 13:13:35,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790716247] [2024-11-13 13:13:35,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:13:35,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-13 13:13:35,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:35,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-13 13:13:35,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1052, Unknown=27, NotChecked=204, Total=1406 [2024-11-13 13:13:35,356 INFO L87 Difference]: Start difference. First operand 155 states and 167 transitions. Second operand has 38 states, 37 states have (on average 3.3513513513513513) internal successors, (124), 38 states have internal predecessors, (124), 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-11-13 13:13:37,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:37,865 INFO L93 Difference]: Finished difference Result 245 states and 268 transitions. [2024-11-13 13:13:37,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-13 13:13:37,866 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.3513513513513513) internal successors, (124), 38 states have internal predecessors, (124), 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) Word has length 42 [2024-11-13 13:13:37,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:37,867 INFO L225 Difference]: With dead ends: 245 [2024-11-13 13:13:37,867 INFO L226 Difference]: Without dead ends: 245 [2024-11-13 13:13:37,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=360, Invalid=2275, Unknown=29, NotChecked=306, Total=2970 [2024-11-13 13:13:37,869 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 598 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 1698 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 2396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 624 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:37,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 882 Invalid, 2396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1698 Invalid, 0 Unknown, 624 Unchecked, 1.6s Time] [2024-11-13 13:13:37,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-13 13:13:37,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 192. [2024-11-13 13:13:37,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 169 states have (on average 1.2189349112426036) internal successors, (206), 190 states have internal predecessors, (206), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:37,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 209 transitions. [2024-11-13 13:13:37,875 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 209 transitions. Word has length 42 [2024-11-13 13:13:37,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:37,876 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 209 transitions. [2024-11-13 13:13:37,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.3513513513513513) internal successors, (124), 38 states have internal predecessors, (124), 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-11-13 13:13:37,876 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 209 transitions. [2024-11-13 13:13:37,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 13:13:37,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:37,877 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:37,897 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 13:13:38,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:38,077 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:13:38,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:38,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1983957767, now seen corresponding path program 1 times [2024-11-13 13:13:38,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:38,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102422114] [2024-11-13 13:13:38,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:38,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:38,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:38,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102422114] [2024-11-13 13:13:38,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102422114] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:13:38,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421192224] [2024-11-13 13:13:38,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:38,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:38,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:13:38,574 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:13:38,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 13:13:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:38,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-13 13:13:38,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:13:38,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-13 13:13:38,816 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 13:13:38,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 13:13:38,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:13:39,017 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:13:39,017 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-13 13:13:39,166 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:13:39,167 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 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-13 13:13:39,220 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:13:39,221 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-13 13:13:39,499 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 25 treesize of output 13 [2024-11-13 13:13:39,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:39,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:13:40,079 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_94| Int) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1175 (Array Int Int))) (or (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1175))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1177)) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_94|)) 1) (< |v_ULTIMATE.start_main_~end~0#1.offset_94| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_94|))) is different from false [2024-11-13 13:13:40,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:40,176 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2024-11-13 13:13:40,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:40,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 144 treesize of output 131 [2024-11-13 13:13:40,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2024-11-13 13:13:40,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:40,211 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 76 treesize of output 74 [2024-11-13 13:13:41,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:41,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421192224] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:13:41,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:13:41,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 35 [2024-11-13 13:13:41,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247177039] [2024-11-13 13:13:41,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:13:41,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-13 13:13:41,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:41,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-13 13:13:41,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1001, Unknown=19, NotChecked=66, Total=1260 [2024-11-13 13:13:41,878 INFO L87 Difference]: Start difference. First operand 192 states and 209 transitions. Second operand has 36 states, 35 states have (on average 3.4571428571428573) internal successors, (121), 36 states have internal predecessors, (121), 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-11-13 13:13:43,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:13:43,602 INFO L93 Difference]: Finished difference Result 287 states and 313 transitions. [2024-11-13 13:13:43,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 13:13:43,603 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.4571428571428573) internal successors, (121), 36 states have internal predecessors, (121), 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) Word has length 42 [2024-11-13 13:13:43,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:13:43,604 INFO L225 Difference]: With dead ends: 287 [2024-11-13 13:13:43,604 INFO L226 Difference]: Without dead ends: 287 [2024-11-13 13:13:43,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=279, Invalid=1512, Unknown=19, NotChecked=82, Total=1892 [2024-11-13 13:13:43,605 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 620 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 239 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:13:43,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 713 Invalid, 1727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1414 Invalid, 0 Unknown, 239 Unchecked, 1.4s Time] [2024-11-13 13:13:43,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-13 13:13:43,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 192. [2024-11-13 13:13:43,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 169 states have (on average 1.21301775147929) internal successors, (205), 190 states have internal predecessors, (205), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:43,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 208 transitions. [2024-11-13 13:13:43,611 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 208 transitions. Word has length 42 [2024-11-13 13:13:43,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:13:43,611 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 208 transitions. [2024-11-13 13:13:43,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.4571428571428573) internal successors, (121), 36 states have internal predecessors, (121), 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-11-13 13:13:43,612 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 208 transitions. [2024-11-13 13:13:43,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-13 13:13:43,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:13:43,612 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:43,632 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 13:13:43,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-13 13:13:43,814 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:13:43,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:43,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1482811008, now seen corresponding path program 1 times [2024-11-13 13:13:43,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:43,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707339665] [2024-11-13 13:13:43,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:43,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:44,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:44,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:44,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707339665] [2024-11-13 13:13:44,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707339665] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:13:44,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975305403] [2024-11-13 13:13:44,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:44,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:44,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:13:44,931 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:13:44,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 13:13:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:45,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-13 13:13:45,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:13:45,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-13 13:13:45,152 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-11-13 13:13:45,226 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:13:45,226 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 11 treesize of output 11 [2024-11-13 13:13:45,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:45,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 13:13:45,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:13:45,401 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:13:45,401 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-13 13:13:45,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 13:13:45,426 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 16 treesize of output 8 [2024-11-13 13:13:45,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:13:45,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:13:45,537 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:13:45,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:13:45,585 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 15 treesize of output 1 [2024-11-13 13:13:45,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:13:45,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:13:45,723 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:13:45,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-13 13:13:45,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 13:13:45,753 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-13 13:13:45,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2024-11-13 13:13:45,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-13 13:13:45,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 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-11-13 13:13:45,911 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 13:13:45,911 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 1 case distinctions, treesize of input 20 treesize of output 19 [2024-11-13 13:13:45,966 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-13 13:13:45,966 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 1 case distinctions, treesize of input 23 treesize of output 26 [2024-11-13 13:13:46,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:46,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:13:46,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:46,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 13:13:46,337 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_101| Int)) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_101| 0) (not (= (select v_arrayElimArr_9 (+ |v_ULTIMATE.start_main_~end~0#1.offset_101| 8)) 1)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1337) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1335) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1336) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) |v_ULTIMATE.start_main_~end~0#1.offset_101|))) is different from false [2024-11-13 13:13:46,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:46,445 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2024-11-13 13:13:46,453 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 60 treesize of output 52 [2024-11-13 13:13:46,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-13 13:13:46,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:46,471 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-13 13:13:46,483 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 30 treesize of output 22 [2024-11-13 13:13:46,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-13 13:13:47,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:47,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 103 [2024-11-13 13:13:47,666 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_7) v_prenex_6 v_prenex_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_6) (not (= (select v_prenex_8 8) 1)))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1332))) (or (not (= (select v_arrayElimArr_9 8) 1)) (= (select (select (store (store .cse1 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1337) v_arrayElimCell_78 v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (= (select (select (store .cse1 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_~end~0#1.base|))))) is different from false [2024-11-13 13:13:48,012 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| .cse0) (forall ((v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse1 (store |c_#memory_int#1| .cse0 v_ArrVal_1332))) (or (not (= (select v_arrayElimArr_9 8) 1)) (= (select (select (store .cse1 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse1 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1337) v_arrayElimCell_78 v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))))) (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int))) (or (= .cse0 v_prenex_6) (= (select (select (store (store |c_#memory_int#1| .cse0 v_prenex_7) v_prenex_6 v_prenex_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= (select v_prenex_8 8) 1)))))) is different from false [2024-11-13 13:13:48,477 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_1329 (Array Int Int)) (v_ArrVal_1328 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1329) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse0 (store (store |c_#memory_int#1| .cse2 v_ArrVal_1328) .cse3 v_ArrVal_1332))) (or (not (= (select v_arrayElimArr_9 8) 1)) (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse0 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1337) v_arrayElimCell_78 v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| .cse3)))) (forall ((v_ArrVal_1329 (Array Int Int)) (v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (v_ArrVal_1328 (Array Int Int)) (v_prenex_7 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1329) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (= (select (select (store (store (store |c_#memory_int#1| .cse2 v_ArrVal_1328) .cse4 v_prenex_7) v_prenex_6 v_prenex_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= (select v_prenex_8 8) 1)) (= .cse4 v_prenex_6)))))) is different from false [2024-11-13 13:13:48,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:48,531 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 88 [2024-11-13 13:13:48,536 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 170 treesize of output 154 [2024-11-13 13:13:48,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 71 [2024-11-13 13:13:48,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:48,993 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 52 [2024-11-13 13:13:48,997 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 97 treesize of output 85 [2024-11-13 13:13:49,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2024-11-13 13:13:49,309 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse3 (not .cse4)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_prenex_6 Int)) (or (forall ((v_arrayElimCell_87 Int)) (or (= v_prenex_6 v_arrayElimCell_87) (forall ((v_prenex_8 (Array Int Int))) (or (forall ((v_ArrVal_1325 Int) (v_prenex_7 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)))) (or (forall ((v_ArrVal_1328 (Array Int Int))) (= (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1328) v_arrayElimCell_87 v_prenex_7) v_prenex_6 v_prenex_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_7) v_prenex_6 v_prenex_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (not (= (select v_prenex_8 8) 1)))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_6))) (or .cse3 (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1325 Int) (v_arrayElimCell_87 Int) (v_prenex_7 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1328) v_arrayElimCell_87 v_prenex_7) v_prenex_6 v_prenex_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_6 v_arrayElimCell_87) (not (= (select v_prenex_8 8) 1)) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_6)))) (or (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (v_ArrVal_1325 Int) (v_prenex_7 (Array Int Int))) (or (not (= (select v_prenex_8 8) 1)) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_6) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_7) v_prenex_6 v_prenex_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))) .cse4) (or .cse4 (forall ((v_ArrVal_1337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1332 (Array Int Int)) (v_ArrVal_1325 Int) (v_arrayElimArr_9 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse5 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1332))) (or (not (= (select v_arrayElimArr_9 8) 1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse5 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1337) v_arrayElimCell_78 v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse5 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))) (or .cse3 (forall ((v_ArrVal_1328 (Array Int Int)) (v_arrayElimCell_85 Int) (v_ArrVal_1337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1332 (Array Int Int)) (v_ArrVal_1325 Int) (v_arrayElimArr_9 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)))) (or (= (select (select (store (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1328) v_arrayElimCell_85 v_ArrVal_1332) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= (select v_arrayElimArr_9 8) 1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1332) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1337) v_arrayElimCell_78 v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_85))))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimCell_85 Int)) (or (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 8) 1)) (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (v_ArrVal_1325 Int) (v_arrayElimCell_78 Int)) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)))) (let ((.cse8 (store .cse7 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1332))) (or (= (select (select (store (store (store .cse7 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1328) v_arrayElimCell_85 v_ArrVal_1332) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse8 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1337) v_arrayElimCell_78 v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse8 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_85))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (or (and (forall ((v_prenex_6 Int) (v_arrayElimCell_87 Int)) (or (= v_prenex_6 v_arrayElimCell_87) (forall ((v_prenex_8 (Array Int Int))) (or (forall ((v_ArrVal_1325 Int) (v_prenex_7 (Array Int Int))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)))) (or (forall ((v_ArrVal_1328 (Array Int Int))) (= (select (select (store (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1328) v_arrayElimCell_87 v_prenex_7) v_prenex_6 v_prenex_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (= (select (select (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_7) v_prenex_6 v_prenex_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (not (= (select v_prenex_8 8) 1)))))) (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1325 Int) (v_arrayElimCell_87 Int) (v_prenex_7 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1328) v_arrayElimCell_87 v_prenex_7) v_prenex_6 v_prenex_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_6 v_arrayElimCell_87) (not (= (select v_prenex_8 8) 1))))) .cse3) (or .cse3 (and (forall ((v_ArrVal_1328 (Array Int Int)) (v_arrayElimCell_85 Int) (v_ArrVal_1337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1332 (Array Int Int)) (v_ArrVal_1325 Int) (v_arrayElimArr_9 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)))) (or (= (select (select (store (store (store .cse10 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1328) v_arrayElimCell_85 v_ArrVal_1332) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= (select v_arrayElimArr_9 8) 1)) (= (select (select (store (store (store .cse10 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1332) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1337) v_arrayElimCell_78 v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_85)))) (forall ((v_arrayElimCell_85 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 8) 1)) (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (v_ArrVal_1325 Int) (v_arrayElimCell_78 Int)) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)))) (let ((.cse12 (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1332))) (or (= (select (select (store (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1328) v_arrayElimCell_85 v_ArrVal_1332) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse12 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1337) v_arrayElimCell_78 v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse12 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_85))) (forall ((v_ArrVal_1328 (Array Int Int)) (v_arrayElimCell_85 Int) (v_ArrVal_1337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1332 (Array Int Int)) (v_ArrVal_1325 Int) (v_arrayElimArr_9 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse13 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1328) v_arrayElimCell_85 v_ArrVal_1332))) (or (= (select (select (store .cse13 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= (select v_arrayElimArr_9 8) 1)) (= (select (select (store (store .cse13 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1337) v_arrayElimCell_78 v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_85)))))) (or .cse4 (and (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (v_ArrVal_1325 Int) (v_arrayElimArr_9 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse14 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1332))) (or (not (= (select v_arrayElimArr_9 8) 1)) (= (select (select (store (store .cse14 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1337) v_arrayElimCell_78 v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse14 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_arrayElimCell_85 Int) (v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 8) 1)) (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (v_ArrVal_1325 Int) (v_arrayElimCell_78 Int)) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)))) (let ((.cse16 (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1332))) (or (= (select (select (store (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1328) v_arrayElimCell_85 v_ArrVal_1332) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse16 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1337) v_arrayElimCell_78 v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse16 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))))))))) (or (forall ((v_ArrVal_1328 (Array Int Int)) (v_arrayElimCell_85 Int) (v_ArrVal_1337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1332 (Array Int Int)) (v_ArrVal_1325 Int) (v_arrayElimArr_9 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse17 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1328) v_arrayElimCell_85 v_ArrVal_1332))) (or (= (select (select (store .cse17 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= (select v_arrayElimArr_9 8) 1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse17 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1337) v_arrayElimCell_78 v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_85)))) .cse3) (or .cse4 (and (forall ((v_prenex_6 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_6) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimCell_87 Int)) (or (forall ((v_ArrVal_1325 Int) (v_prenex_7 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)))) (or (forall ((v_ArrVal_1328 (Array Int Int))) (= (select (select (store (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1328) v_arrayElimCell_87 v_prenex_7) v_prenex_6 v_prenex_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (= (select (select (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_7) v_prenex_6 v_prenex_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (not (= (select v_prenex_8 8) 1)))))) (forall ((v_prenex_6 Int)) (or (forall ((v_prenex_8 (Array Int Int)) (v_ArrVal_1325 Int) (v_prenex_7 (Array Int Int))) (or (not (= (select v_prenex_8 8) 1)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_7) v_prenex_6 v_prenex_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_6)))))))) is different from false [2024-11-13 13:14:05,552 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:14:05,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2024-11-13 13:14:05,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:14:05,573 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 60 treesize of output 58 [2024-11-13 13:14:05,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2024-11-13 13:14:05,596 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:14:05,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:14:05,602 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2024-11-13 13:14:05,605 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:14:05,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-13 13:14:05,618 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-13 13:14:05,618 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 14 treesize of output 11 [2024-11-13 13:14:05,626 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:14:05,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:14:05,633 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 70 [2024-11-13 13:14:05,637 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:14:05,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 194 [2024-11-13 13:14:05,655 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-13 13:14:05,655 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 14 treesize of output 11 [2024-11-13 13:14:05,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 13:14:05,672 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:14:05,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:14:05,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 52 [2024-11-13 13:14:05,686 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:14:05,692 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 165 treesize of output 141 [2024-11-13 13:14:05,707 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-13 13:14:05,707 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 14 treesize of output 11 [2024-11-13 13:14:05,715 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:14:05,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:14:05,722 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2024-11-13 13:14:05,726 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:14:05,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-13 13:14:05,743 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-13 13:14:05,743 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 14 treesize of output 11 [2024-11-13 13:14:05,753 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:14:05,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:14:05,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 70 [2024-11-13 13:14:05,767 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:14:05,773 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 294 treesize of output 258 [2024-11-13 13:14:05,787 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-13 13:14:05,787 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 14 treesize of output 11 [2024-11-13 13:14:05,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 13:14:05,803 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:14:05,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:14:05,812 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 52 [2024-11-13 13:14:05,816 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:14:05,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 77 [2024-11-13 13:14:05,836 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-13 13:14:05,836 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 14 treesize of output 11 [2024-11-13 13:14:05,844 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:14:05,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:14:05,852 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 52 [2024-11-13 13:14:05,856 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:14:05,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 141 [2024-11-13 13:14:05,872 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-13 13:14:05,872 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 14 treesize of output 11 [2024-11-13 13:14:05,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 13:14:05,888 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:14:05,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:14:05,897 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 52 [2024-11-13 13:14:05,902 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:14:05,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 77 [2024-11-13 13:14:05,917 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-13 13:14:05,917 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 14 treesize of output 11 [2024-11-13 13:14:05,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 13:14:10,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:14:10,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975305403] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:14:10,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:14:10,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 22] total 53 [2024-11-13 13:14:10,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077866592] [2024-11-13 13:14:10,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:14:10,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-13 13:14:10,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:14:10,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-13 13:14:10,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1886, Unknown=70, NotChecked=480, Total=2756 [2024-11-13 13:14:10,721 INFO L87 Difference]: Start difference. First operand 192 states and 208 transitions. Second operand has 53 states, 53 states have (on average 2.169811320754717) internal successors, (115), 53 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:14:14,359 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse3 (not .cse4)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (forall ((v_prenex_6 Int)) (or (forall ((v_arrayElimCell_87 Int)) (or (= v_prenex_6 v_arrayElimCell_87) (forall ((v_prenex_8 (Array Int Int))) (or (forall ((v_ArrVal_1325 Int) (v_prenex_7 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)))) (or (forall ((v_ArrVal_1328 (Array Int Int))) (= (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1328) v_arrayElimCell_87 v_prenex_7) v_prenex_6 v_prenex_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_7) v_prenex_6 v_prenex_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (not (= (select v_prenex_8 8) 1)))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_6))) (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (or .cse3 (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1325 Int) (v_arrayElimCell_87 Int) (v_prenex_7 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1328) v_arrayElimCell_87 v_prenex_7) v_prenex_6 v_prenex_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_6 v_arrayElimCell_87) (not (= (select v_prenex_8 8) 1)) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_6)))) (or (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (v_ArrVal_1325 Int) (v_prenex_7 (Array Int Int))) (or (not (= (select v_prenex_8 8) 1)) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_6) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_7) v_prenex_6 v_prenex_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))) .cse4) (or .cse4 (forall ((v_ArrVal_1337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1332 (Array Int Int)) (v_ArrVal_1325 Int) (v_arrayElimArr_9 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse5 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1332))) (or (not (= (select v_arrayElimArr_9 8) 1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse5 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1337) v_arrayElimCell_78 v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse5 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))) (or .cse3 (forall ((v_ArrVal_1328 (Array Int Int)) (v_arrayElimCell_85 Int) (v_ArrVal_1337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1332 (Array Int Int)) (v_ArrVal_1325 Int) (v_arrayElimArr_9 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)))) (or (= (select (select (store (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1328) v_arrayElimCell_85 v_ArrVal_1332) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= (select v_arrayElimArr_9 8) 1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1332) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1337) v_arrayElimCell_78 v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_85))))) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base|) 8) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimCell_85 Int)) (or (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 8) 1)) (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (v_ArrVal_1325 Int) (v_arrayElimCell_78 Int)) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)))) (let ((.cse8 (store .cse7 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1332))) (or (= (select (select (store (store (store .cse7 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1328) v_arrayElimCell_85 v_ArrVal_1332) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse8 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1337) v_arrayElimCell_78 v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse8 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_85))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (or (and (forall ((v_prenex_6 Int) (v_arrayElimCell_87 Int)) (or (= v_prenex_6 v_arrayElimCell_87) (forall ((v_prenex_8 (Array Int Int))) (or (forall ((v_ArrVal_1325 Int) (v_prenex_7 (Array Int Int))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)))) (or (forall ((v_ArrVal_1328 (Array Int Int))) (= (select (select (store (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1328) v_arrayElimCell_87 v_prenex_7) v_prenex_6 v_prenex_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (= (select (select (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_7) v_prenex_6 v_prenex_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (not (= (select v_prenex_8 8) 1)))))) (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1325 Int) (v_arrayElimCell_87 Int) (v_prenex_7 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1328) v_arrayElimCell_87 v_prenex_7) v_prenex_6 v_prenex_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_6 v_arrayElimCell_87) (not (= (select v_prenex_8 8) 1))))) .cse3) (forall ((v_arrayElimArr_9 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_101| Int)) (or (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) |v_ULTIMATE.start_main_~end~0#1.offset_101|) (< |v_ULTIMATE.start_main_~end~0#1.offset_101| 0) (not (= (select v_arrayElimArr_9 (+ |v_ULTIMATE.start_main_~end~0#1.offset_101| 8)) 1)) (= (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))) (or .cse3 (and (forall ((v_ArrVal_1328 (Array Int Int)) (v_arrayElimCell_85 Int) (v_ArrVal_1337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1332 (Array Int Int)) (v_ArrVal_1325 Int) (v_arrayElimArr_9 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)))) (or (= (select (select (store (store (store .cse10 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1328) v_arrayElimCell_85 v_ArrVal_1332) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= (select v_arrayElimArr_9 8) 1)) (= (select (select (store (store (store .cse10 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1332) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1337) v_arrayElimCell_78 v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_85)))) (forall ((v_arrayElimCell_85 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 8) 1)) (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (v_ArrVal_1325 Int) (v_arrayElimCell_78 Int)) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)))) (let ((.cse12 (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1332))) (or (= (select (select (store (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1328) v_arrayElimCell_85 v_ArrVal_1332) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse12 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1337) v_arrayElimCell_78 v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse12 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_85))) (forall ((v_ArrVal_1328 (Array Int Int)) (v_arrayElimCell_85 Int) (v_ArrVal_1337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1332 (Array Int Int)) (v_ArrVal_1325 Int) (v_arrayElimArr_9 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse13 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1328) v_arrayElimCell_85 v_ArrVal_1332))) (or (= (select (select (store .cse13 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= (select v_arrayElimArr_9 8) 1)) (= (select (select (store (store .cse13 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1337) v_arrayElimCell_78 v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_85)))))) (or .cse4 (and (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (v_ArrVal_1325 Int) (v_arrayElimArr_9 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse14 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1332))) (or (not (= (select v_arrayElimArr_9 8) 1)) (= (select (select (store (store .cse14 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1337) v_arrayElimCell_78 v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse14 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_arrayElimCell_85 Int) (v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 8) 1)) (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1332 (Array Int Int)) (v_ArrVal_1325 Int) (v_arrayElimCell_78 Int)) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)))) (let ((.cse16 (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1332))) (or (= (select (select (store (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1328) v_arrayElimCell_85 v_ArrVal_1332) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse16 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1337) v_arrayElimCell_78 v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse16 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))))))))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (or (forall ((v_ArrVal_1328 (Array Int Int)) (v_arrayElimCell_85 Int) (v_ArrVal_1337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1332 (Array Int Int)) (v_ArrVal_1325 Int) (v_arrayElimArr_9 (Array Int Int)) (v_arrayElimCell_78 Int)) (let ((.cse17 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1328) v_arrayElimCell_85 v_ArrVal_1332))) (or (= (select (select (store .cse17 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= (select v_arrayElimArr_9 8) 1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse17 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1337) v_arrayElimCell_78 v_arrayElimArr_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_85)))) .cse3) (or .cse4 (and (forall ((v_prenex_6 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_6) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimCell_87 Int)) (or (forall ((v_ArrVal_1325 Int) (v_prenex_7 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)))) (or (forall ((v_ArrVal_1328 (Array Int Int))) (= (select (select (store (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1328) v_arrayElimCell_87 v_prenex_7) v_prenex_6 v_prenex_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (= (select (select (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_7) v_prenex_6 v_prenex_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (not (= (select v_prenex_8 8) 1)))))) (forall ((v_prenex_6 Int)) (or (forall ((v_prenex_8 (Array Int Int)) (v_ArrVal_1325 Int) (v_prenex_7 (Array Int Int))) (or (not (= (select v_prenex_8 8) 1)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1325)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_7) v_prenex_6 v_prenex_8) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_6))))) (= (select .cse2 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 8)) 1)))) is different from false [2024-11-13 13:14:17,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:14:49,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:14:49,182 INFO L93 Difference]: Finished difference Result 399 states and 435 transitions. [2024-11-13 13:14:49,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-13 13:14:49,183 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.169811320754717) internal successors, (115), 53 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-13 13:14:49,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:14:49,184 INFO L225 Difference]: With dead ends: 399 [2024-11-13 13:14:49,184 INFO L226 Difference]: Without dead ends: 399 [2024-11-13 13:14:49,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1808 ImplicationChecksByTransitivity, 37.8s TimeCoverageRelationStatistics Valid=981, Invalid=5072, Unknown=133, NotChecked=954, Total=7140 [2024-11-13 13:14:49,186 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 656 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 1901 mSolverCounterSat, 89 mSolverCounterUnsat, 79 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 3785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1901 IncrementalHoareTripleChecker+Invalid, 79 IncrementalHoareTripleChecker+Unknown, 1716 IncrementalHoareTripleChecker+Unchecked, 21.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:14:49,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 1225 Invalid, 3785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1901 Invalid, 79 Unknown, 1716 Unchecked, 21.9s Time] [2024-11-13 13:14:49,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-13 13:14:49,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 276. [2024-11-13 13:14:49,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 253 states have (on average 1.1660079051383399) internal successors, (295), 274 states have internal predecessors, (295), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:14:49,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 298 transitions. [2024-11-13 13:14:49,194 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 298 transitions. Word has length 47 [2024-11-13 13:14:49,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:14:49,194 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 298 transitions. [2024-11-13 13:14:49,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.169811320754717) internal successors, (115), 53 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:14:49,195 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 298 transitions. [2024-11-13 13:14:49,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-13 13:14:49,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:14:49,195 INFO L215 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:14:49,217 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 13:14:49,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:14:49,400 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:14:49,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:14:49,401 INFO L85 PathProgramCache]: Analyzing trace with hash -245607633, now seen corresponding path program 2 times [2024-11-13 13:14:49,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:14:49,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434949327] [2024-11-13 13:14:49,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:14:49,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:14:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:14:50,801 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:14:50,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:14:50,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434949327] [2024-11-13 13:14:50,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434949327] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:14:50,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873991472] [2024-11-13 13:14:50,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:14:50,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:14:50,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:14:50,803 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:14:50,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 13:14:50,982 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:14:50,982 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:14:50,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-13 13:14:50,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:14:51,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-13 13:14:51,145 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:14:51,145 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 11 treesize of output 11 [2024-11-13 13:14:51,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:14:51,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:14:51,376 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:14:51,377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-13 13:14:51,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 13:14:51,565 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-13 13:14:51,565 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 1 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 13:14:51,583 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:14:51,596 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-13 13:14:51,596 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 1 case distinctions, treesize of input 27 treesize of output 22 [2024-11-13 13:14:51,738 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 13:14:51,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 58 [2024-11-13 13:14:51,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2024-11-13 13:14:52,388 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:14:52,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:15:06,911 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1438 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1438))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (< .cse0 0) (forall ((v_ArrVal_1439 (Array Int Int)) (v_ArrVal_1444 Int) (v_ArrVal_1445 Int) (|v_ULTIMATE.start_main_~end~0#1.offset_110| Int)) (or (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_109| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1439))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse4 (+ 8 .cse0))) (let ((.cse1 (store .cse5 .cse3 (store (store (select .cse5 .cse3) .cse0 0) .cse4 v_ArrVal_1444)))) (or (= (select (select .cse1 (select (select (store .cse2 .cse3 (store (store (select .cse2 .cse3) .cse0 0) .cse4 v_ArrVal_1445)) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_110|)) |v_ULTIMATE.start_main_~end~0#1.offset_109|) 0) (< |v_ULTIMATE.start_main_~end~0#1.offset_109| 0) (< (select (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_110|) |v_ULTIMATE.start_main_~end~0#1.offset_109|)))))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_110|) (< |v_ULTIMATE.start_main_~end~0#1.offset_110| 0))))))) (forall ((v_ArrVal_1438 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1438))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (< .cse6 0) (forall ((v_ArrVal_1439 (Array Int Int)) (v_ArrVal_1444 Int) (v_ArrVal_1445 Int) (|v_ULTIMATE.start_main_~end~0#1.offset_110| Int)) (or (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_109| Int)) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1439))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse10 (+ 8 .cse6))) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_109| 0) (= (select (let ((.cse7 (store .cse8 .cse9 (store (store (select .cse8 .cse9) .cse6 0) .cse10 v_ArrVal_1445)))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_110|))) |v_ULTIMATE.start_main_~end~0#1.offset_109|) 0) (< (select (select (store .cse11 .cse9 (store (store (select .cse11 .cse9) .cse6 0) .cse10 v_ArrVal_1444)) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_110|) |v_ULTIMATE.start_main_~end~0#1.offset_109|))))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_110|) (< |v_ULTIMATE.start_main_~end~0#1.offset_110| 0)))))))) is different from false [2024-11-13 13:15:11,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:11,529 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 663 treesize of output 512 [2024-11-13 13:15:11,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:11,547 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 503 treesize of output 368 [2024-11-13 13:15:15,126 INFO L349 Elim1Store]: treesize reduction 238, result has 62.3 percent of original size [2024-11-13 13:15:15,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 14 new quantified variables, introduced 45 case distinctions, treesize of input 11498 treesize of output 10514 [2024-11-13 13:15:15,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:15:17,899 INFO L349 Elim1Store]: treesize reduction 262, result has 61.8 percent of original size [2024-11-13 13:15:17,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 12 new quantified variables, introduced 45 case distinctions, treesize of input 15104 treesize of output 13928 [2024-11-13 13:15:18,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:18,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7193 treesize of output 6585 [2024-11-13 13:15:19,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:19,574 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 8879 treesize of output 8447 [2024-11-13 13:15:20,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:20,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 11096 treesize of output 10550 [2024-11-13 13:15:21,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:15:21,558 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 7939 treesize of output 7541 [2024-11-13 13:20:02,104 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-13 13:20:02,105 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-13 13:20:02,105 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-13 13:20:02,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 13:20:02,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-13 13:20:02,306 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:590) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.pushInner(QuantifierPusher.java:274) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:194) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 83 more [2024-11-13 13:20:02,312 INFO L158 Benchmark]: Toolchain (without parser) took 429967.07ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 91.3MB in the beginning and 821.0MB in the end (delta: -729.6MB). Peak memory consumption was 843.3MB. Max. memory is 16.1GB. [2024-11-13 13:20:02,312 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 117.4MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:20:02,312 INFO L158 Benchmark]: CACSL2BoogieTranslator took 471.46ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 73.7MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 13:20:02,313 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.89ms. Allocated memory is still 117.4MB. Free memory was 73.7MB in the beginning and 72.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:20:02,313 INFO L158 Benchmark]: Boogie Preprocessor took 77.41ms. Allocated memory is still 117.4MB. Free memory was 71.7MB in the beginning and 69.3MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:20:02,313 INFO L158 Benchmark]: RCFGBuilder took 791.92ms. Allocated memory is still 117.4MB. Free memory was 69.3MB in the beginning and 43.5MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 13:20:02,313 INFO L158 Benchmark]: TraceAbstraction took 428553.56ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 42.9MB in the beginning and 821.0MB in the end (delta: -778.0MB). Peak memory consumption was 793.0MB. Max. memory is 16.1GB. [2024-11-13 13:20:02,315 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45ms. Allocated memory is still 117.4MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 471.46ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 73.7MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.89ms. Allocated memory is still 117.4MB. Free memory was 73.7MB in the beginning and 72.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 77.41ms. Allocated memory is still 117.4MB. Free memory was 71.7MB in the beginning and 69.3MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 791.92ms. Allocated memory is still 117.4MB. Free memory was 69.3MB in the beginning and 43.5MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 428553.56ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 42.9MB in the beginning and 821.0MB in the end (delta: -778.0MB). Peak memory consumption was 793.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:20:04,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:20:04,892 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-13 13:20:04,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:20:04,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:20:04,952 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:20:04,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:20:04,953 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:20:04,953 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:20:04,953 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:20:04,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:20:04,954 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:20:04,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:20:04,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:20:04,954 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:20:04,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:20:04,955 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:20:04,955 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:20:04,955 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:20:04,955 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:20:04,955 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 13:20:04,955 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 13:20:04,955 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 13:20:04,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:20:04,956 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:20:04,956 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 13:20:04,956 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:20:04,956 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 13:20:04,956 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 13:20:04,956 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:20:04,957 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:20:04,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:20:04,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:20:04,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:20:04,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:20:04,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:20:04,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:20:04,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:20:04,958 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 13:20:04,958 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 13:20:04,958 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:20:04,958 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:20:04,958 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:20:04,958 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:20:04,959 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd 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(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 [2024-11-13 13:20:05,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:20:05,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:20:05,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:20:05,294 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:20:05,294 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:20:05,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i Unable to find full path for "g++" [2024-11-13 13:20:07,346 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:20:07,660 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:20:07,665 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2024-11-13 13:20:07,685 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/data/c5f016d51/9f638f59a8724cbd972002cd3a348fc9/FLAG64c4b5ab9 [2024-11-13 13:20:07,710 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/data/c5f016d51/9f638f59a8724cbd972002cd3a348fc9 [2024-11-13 13:20:07,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:20:07,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:20:07,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:20:07,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:20:07,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:20:07,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:20:07" (1/1) ... [2024-11-13 13:20:07,725 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cb4f021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:07, skipping insertion in model container [2024-11-13 13:20:07,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:20:07" (1/1) ... [2024-11-13 13:20:07,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:20:08,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:20:08,183 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:20:08,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:20:08,310 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:20:08,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:08 WrapperNode [2024-11-13 13:20:08,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:20:08,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:20:08,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:20:08,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:20:08,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:08" (1/1) ... [2024-11-13 13:20:08,350 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:08" (1/1) ... [2024-11-13 13:20:08,385 INFO L138 Inliner]: procedures = 122, calls = 46, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 149 [2024-11-13 13:20:08,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:20:08,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:20:08,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:20:08,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:20:08,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:08" (1/1) ... [2024-11-13 13:20:08,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:08" (1/1) ... [2024-11-13 13:20:08,406 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:08" (1/1) ... [2024-11-13 13:20:08,435 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [2, 27]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 12 writes are split as follows [0, 12]. [2024-11-13 13:20:08,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:08" (1/1) ... [2024-11-13 13:20:08,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:08" (1/1) ... [2024-11-13 13:20:08,456 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:08" (1/1) ... [2024-11-13 13:20:08,464 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:08" (1/1) ... [2024-11-13 13:20:08,469 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:08" (1/1) ... [2024-11-13 13:20:08,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:08" (1/1) ... [2024-11-13 13:20:08,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:20:08,481 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:20:08,482 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:20:08,482 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:20:08,483 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:08" (1/1) ... [2024-11-13 13:20:08,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:20:08,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:08,531 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:20:08,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:20:08,568 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-13 13:20:08,568 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-13 13:20:08,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 13:20:08,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 13:20:08,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 13:20:08,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:20:08,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 13:20:08,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 13:20:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 13:20:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 13:20:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 13:20:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 13:20:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 13:20:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 13:20:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 13:20:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:20:08,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:20:08,714 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:20:08,716 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:20:09,494 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-11-13 13:20:09,494 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:20:09,508 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:20:09,508 INFO L316 CfgBuilder]: Removed 17 assume(true) statements. [2024-11-13 13:20:09,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:20:09 BoogieIcfgContainer [2024-11-13 13:20:09,509 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:20:09,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:20:09,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:20:09,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:20:09,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:20:07" (1/3) ... [2024-11-13 13:20:09,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3667612d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:20:09, skipping insertion in model container [2024-11-13 13:20:09,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:20:08" (2/3) ... [2024-11-13 13:20:09,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3667612d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:20:09, skipping insertion in model container [2024-11-13 13:20:09,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:20:09" (3/3) ... [2024-11-13 13:20:09,536 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2024-11-13 13:20:09,551 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:20:09,552 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-rb-cnstr_1-1.i that has 2 procedures, 161 locations, 1 initial locations, 10 loop locations, and 65 error locations. [2024-11-13 13:20:09,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:20:09,606 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@79a8e618, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:20:09,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2024-11-13 13:20:09,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 161 states, 87 states have (on average 2.103448275862069) internal successors, (183), 152 states have internal predecessors, (183), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-13 13:20:09,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 13:20:09,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:09,617 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-13 13:20:09,618 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:20:09,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:09,623 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-13 13:20:09,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:09,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1225730260] [2024-11-13 13:20:09,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:09,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:09,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:09,640 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:09,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:20:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:09,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 13:20:09,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:09,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-13 13:20:09,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:09,829 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:09,830 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:09,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225730260] [2024-11-13 13:20:09,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225730260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:09,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:09,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:20:09,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603136343] [2024-11-13 13:20:09,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:09,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:20:09,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:09,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:20:09,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:20:09,871 INFO L87 Difference]: Start difference. First operand has 161 states, 87 states have (on average 2.103448275862069) internal successors, (183), 152 states have internal predecessors, (183), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-13 13:20:10,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:10,241 INFO L93 Difference]: Finished difference Result 147 states and 160 transitions. [2024-11-13 13:20:10,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:20:10,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) Word has length 3 [2024-11-13 13:20:10,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:10,255 INFO L225 Difference]: With dead ends: 147 [2024-11-13 13:20:10,255 INFO L226 Difference]: Without dead ends: 145 [2024-11-13 13:20:10,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:20:10,263 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 117 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:10,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 101 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:20:10,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-13 13:20:10,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-13 13:20:10,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 80 states have (on average 1.8875) internal successors, (151), 143 states have internal predecessors, (151), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2024-11-13 13:20:10,321 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 3 [2024-11-13 13:20:10,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:10,322 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2024-11-13 13:20:10,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-13 13:20:10,322 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2024-11-13 13:20:10,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 13:20:10,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:10,323 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-13 13:20:10,347 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 13:20:10,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:10,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:20:10,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:10,528 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-13 13:20:10,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:10,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1926043393] [2024-11-13 13:20:10,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:10,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:10,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:10,530 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:10,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:20:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:10,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 13:20:10,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:10,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-13 13:20:10,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:10,641 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:10,642 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:10,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926043393] [2024-11-13 13:20:10,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926043393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:10,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:10,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:20:10,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579335514] [2024-11-13 13:20:10,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:10,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:20:10,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:10,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:20:10,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:20:10,646 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-13 13:20:11,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:11,039 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2024-11-13 13:20:11,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:20:11,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) Word has length 3 [2024-11-13 13:20:11,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:11,042 INFO L225 Difference]: With dead ends: 149 [2024-11-13 13:20:11,042 INFO L226 Difference]: Without dead ends: 149 [2024-11-13 13:20:11,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:20:11,043 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 111 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:11,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 112 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:20:11,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-13 13:20:11,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-13 13:20:11,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 87 states have (on average 1.7816091954022988) internal successors, (155), 147 states have internal predecessors, (155), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:11,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 162 transitions. [2024-11-13 13:20:11,053 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 162 transitions. Word has length 3 [2024-11-13 13:20:11,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:11,053 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 162 transitions. [2024-11-13 13:20:11,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-13 13:20:11,054 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 162 transitions. [2024-11-13 13:20:11,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 13:20:11,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:11,054 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:11,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 13:20:11,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:11,258 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:20:11,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:11,259 INFO L85 PathProgramCache]: Analyzing trace with hash 919163538, now seen corresponding path program 1 times [2024-11-13 13:20:11,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:11,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1956158486] [2024-11-13 13:20:11,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:11,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:11,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:11,264 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:11,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 13:20:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:11,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 13:20:11,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:11,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-13 13:20:11,438 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-13 13:20:11,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 13:20:11,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:11,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:11,448 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:11,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956158486] [2024-11-13 13:20:11,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956158486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:11,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:11,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:20:11,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734643228] [2024-11-13 13:20:11,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:11,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:20:11,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:11,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:20:11,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:20:11,450 INFO L87 Difference]: Start difference. First operand 149 states and 162 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-11-13 13:20:11,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:11,975 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2024-11-13 13:20:11,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:20:11,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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) Word has length 9 [2024-11-13 13:20:11,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:11,979 INFO L225 Difference]: With dead ends: 136 [2024-11-13 13:20:11,980 INFO L226 Difference]: Without dead ends: 136 [2024-11-13 13:20:11,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:20:11,981 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 154 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:11,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 83 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:20:11,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-13 13:20:11,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-13 13:20:11,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 89 states have (on average 1.6179775280898876) internal successors, (144), 134 states have internal predecessors, (144), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:11,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 151 transitions. [2024-11-13 13:20:11,995 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 151 transitions. Word has length 9 [2024-11-13 13:20:11,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:11,995 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 151 transitions. [2024-11-13 13:20:11,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-11-13 13:20:11,996 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2024-11-13 13:20:11,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 13:20:11,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:11,996 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:12,019 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 13:20:12,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:12,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:20:12,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:12,205 INFO L85 PathProgramCache]: Analyzing trace with hash 919163539, now seen corresponding path program 1 times [2024-11-13 13:20:12,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:12,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [942708072] [2024-11-13 13:20:12,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:12,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:12,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:12,208 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:12,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 13:20:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:12,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 13:20:12,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:12,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-13 13:20:12,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-13 13:20:12,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:20:12,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-13 13:20:12,536 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 13:20:12,536 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 13 treesize of output 13 [2024-11-13 13:20:12,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:12,555 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:12,556 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:12,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942708072] [2024-11-13 13:20:12,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942708072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:12,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:12,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:20:12,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288361204] [2024-11-13 13:20:12,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:12,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:20:12,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:12,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:20:12,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:20:12,557 INFO L87 Difference]: Start difference. First operand 136 states and 151 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-11-13 13:20:13,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:13,332 INFO L93 Difference]: Finished difference Result 149 states and 165 transitions. [2024-11-13 13:20:13,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:20:13,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) Word has length 9 [2024-11-13 13:20:13,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:13,335 INFO L225 Difference]: With dead ends: 149 [2024-11-13 13:20:13,335 INFO L226 Difference]: Without dead ends: 149 [2024-11-13 13:20:13,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:20:13,336 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 130 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:13,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 154 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 13:20:13,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-13 13:20:13,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2024-11-13 13:20:13,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 100 states have (on average 1.57) internal successors, (157), 144 states have internal predecessors, (157), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2024-11-13 13:20:13,344 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 9 [2024-11-13 13:20:13,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:13,344 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2024-11-13 13:20:13,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-11-13 13:20:13,345 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2024-11-13 13:20:13,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 13:20:13,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:13,345 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:13,362 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 13:20:13,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:13,550 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:20:13,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:13,550 INFO L85 PathProgramCache]: Analyzing trace with hash 954402083, now seen corresponding path program 1 times [2024-11-13 13:20:13,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:13,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1394132259] [2024-11-13 13:20:13,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:13,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:13,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:13,553 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:13,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 13:20:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:13,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 13:20:13,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:13,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:13,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:13,678 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:13,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394132259] [2024-11-13 13:20:13,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394132259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:13,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:13,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:20:13,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732346786] [2024-11-13 13:20:13,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:13,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:20:13,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:13,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:20:13,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:20:13,680 INFO L87 Difference]: Start difference. First operand 146 states and 164 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:14,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:14,032 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2024-11-13 13:20:14,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:20:14,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-13 13:20:14,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:14,033 INFO L225 Difference]: With dead ends: 152 [2024-11-13 13:20:14,034 INFO L226 Difference]: Without dead ends: 152 [2024-11-13 13:20:14,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:20:14,034 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 131 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:14,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 188 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:20:14,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-13 13:20:14,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 145. [2024-11-13 13:20:14,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 100 states have (on average 1.54) internal successors, (154), 143 states have internal predecessors, (154), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 160 transitions. [2024-11-13 13:20:14,042 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 160 transitions. Word has length 13 [2024-11-13 13:20:14,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:14,043 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 160 transitions. [2024-11-13 13:20:14,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:14,043 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 160 transitions. [2024-11-13 13:20:14,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 13:20:14,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:14,044 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:14,060 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 13:20:14,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:14,248 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:20:14,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:14,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1910514731, now seen corresponding path program 1 times [2024-11-13 13:20:14,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:14,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1729110740] [2024-11-13 13:20:14,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:14,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:14,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:14,251 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:14,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 13:20:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:14,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 13:20:14,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:14,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-13 13:20:14,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:20:14,389 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 19 treesize of output 11 [2024-11-13 13:20:14,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:14,404 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:14,405 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:14,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729110740] [2024-11-13 13:20:14,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729110740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:14,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:14,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:20:14,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768100983] [2024-11-13 13:20:14,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:14,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:20:14,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:14,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:20:14,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:20:14,407 INFO L87 Difference]: Start difference. First operand 145 states and 160 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-11-13 13:20:14,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:14,870 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2024-11-13 13:20:14,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:20:14,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) Word has length 12 [2024-11-13 13:20:14,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:14,871 INFO L225 Difference]: With dead ends: 144 [2024-11-13 13:20:14,871 INFO L226 Difference]: Without dead ends: 144 [2024-11-13 13:20:14,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:20:14,872 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 4 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:14,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 346 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:20:14,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-13 13:20:14,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-13 13:20:14,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 100 states have (on average 1.52) internal successors, (152), 142 states have internal predecessors, (152), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:14,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 158 transitions. [2024-11-13 13:20:14,886 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 158 transitions. Word has length 12 [2024-11-13 13:20:14,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:14,887 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 158 transitions. [2024-11-13 13:20:14,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-11-13 13:20:14,887 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2024-11-13 13:20:14,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 13:20:14,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:14,887 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:14,902 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 13:20:15,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:15,088 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:20:15,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:15,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1910514730, now seen corresponding path program 1 times [2024-11-13 13:20:15,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:15,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2145974384] [2024-11-13 13:20:15,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:15,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:15,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:15,091 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:15,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 13:20:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:15,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 13:20:15,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:15,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-13 13:20:15,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:20:15,225 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-11-13 13:20:15,270 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 17 treesize of output 9 [2024-11-13 13:20:15,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:15,287 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:15,287 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:15,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145974384] [2024-11-13 13:20:15,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145974384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:15,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:15,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:20:15,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478882160] [2024-11-13 13:20:15,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:15,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:20:15,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:15,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:20:15,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:20:15,289 INFO L87 Difference]: Start difference. First operand 144 states and 158 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-11-13 13:20:15,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:15,804 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2024-11-13 13:20:15,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:20:15,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) Word has length 12 [2024-11-13 13:20:15,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:15,807 INFO L225 Difference]: With dead ends: 143 [2024-11-13 13:20:15,807 INFO L226 Difference]: Without dead ends: 143 [2024-11-13 13:20:15,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:20:15,808 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 2 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:15,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 331 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:20:15,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-13 13:20:15,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-13 13:20:15,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 100 states have (on average 1.5) internal successors, (150), 141 states have internal predecessors, (150), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:15,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 156 transitions. [2024-11-13 13:20:15,814 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 156 transitions. Word has length 12 [2024-11-13 13:20:15,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:15,814 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 156 transitions. [2024-11-13 13:20:15,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-11-13 13:20:15,814 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2024-11-13 13:20:15,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 13:20:15,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:15,815 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:15,832 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 13:20:16,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:16,016 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:20:16,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:16,016 INFO L85 PathProgramCache]: Analyzing trace with hash -681502358, now seen corresponding path program 1 times [2024-11-13 13:20:16,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:16,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1458260422] [2024-11-13 13:20:16,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:16,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:16,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:16,020 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:16,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 13:20:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:16,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 13:20:16,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:16,122 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-11-13 13:20:16,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:16,214 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:16,214 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:16,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458260422] [2024-11-13 13:20:16,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458260422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:16,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:16,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:20:16,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402237060] [2024-11-13 13:20:16,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:16,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:20:16,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:16,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:20:16,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:20:16,216 INFO L87 Difference]: Start difference. First operand 143 states and 156 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:16,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:16,761 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2024-11-13 13:20:16,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:20:16,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-13 13:20:16,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:16,763 INFO L225 Difference]: With dead ends: 183 [2024-11-13 13:20:16,763 INFO L226 Difference]: Without dead ends: 183 [2024-11-13 13:20:16,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:20:16,764 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 149 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:16,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 393 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:20:16,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-13 13:20:16,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 148. [2024-11-13 13:20:16,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 105 states have (on average 1.4761904761904763) internal successors, (155), 146 states have internal predecessors, (155), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:16,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 161 transitions. [2024-11-13 13:20:16,773 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 161 transitions. Word has length 16 [2024-11-13 13:20:16,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:16,773 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 161 transitions. [2024-11-13 13:20:16,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:16,774 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 161 transitions. [2024-11-13 13:20:16,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 13:20:16,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:16,774 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:16,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 13:20:16,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:16,975 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:20:16,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:16,975 INFO L85 PathProgramCache]: Analyzing trace with hash -2139547560, now seen corresponding path program 1 times [2024-11-13 13:20:16,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:16,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [701432577] [2024-11-13 13:20:16,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:16,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:16,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:16,977 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:16,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 13:20:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:17,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-13 13:20:17,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:17,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-13 13:20:17,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-13 13:20:17,144 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 13:20:17,145 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 13 treesize of output 13 [2024-11-13 13:20:17,188 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-11-13 13:20:17,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:20:17,305 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:20:17,306 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-13 13:20:17,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 13:20:17,362 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 25 treesize of output 13 [2024-11-13 13:20:17,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 13:20:17,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:17,418 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:17,418 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:17,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701432577] [2024-11-13 13:20:17,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701432577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:17,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:17,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:20:17,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94530493] [2024-11-13 13:20:17,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:17,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:20:17,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:17,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:20:17,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:20:17,421 INFO L87 Difference]: Start difference. First operand 148 states and 161 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:18,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:18,937 INFO L93 Difference]: Finished difference Result 162 states and 179 transitions. [2024-11-13 13:20:18,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:20:18,938 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-13 13:20:18,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:18,939 INFO L225 Difference]: With dead ends: 162 [2024-11-13 13:20:18,939 INFO L226 Difference]: Without dead ends: 162 [2024-11-13 13:20:18,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2024-11-13 13:20:18,940 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 192 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:18,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 312 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 13:20:18,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-13 13:20:18,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 152. [2024-11-13 13:20:18,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 115 states have (on average 1.4173913043478261) internal successors, (163), 150 states have internal predecessors, (163), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:18,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 169 transitions. [2024-11-13 13:20:18,946 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 169 transitions. Word has length 16 [2024-11-13 13:20:18,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:18,946 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 169 transitions. [2024-11-13 13:20:18,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:18,947 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 169 transitions. [2024-11-13 13:20:18,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 13:20:18,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:18,947 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:18,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-13 13:20:19,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:19,153 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:20:19,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:19,154 INFO L85 PathProgramCache]: Analyzing trace with hash -2139547561, now seen corresponding path program 1 times [2024-11-13 13:20:19,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:19,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [559290268] [2024-11-13 13:20:19,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:19,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:19,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:19,159 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:19,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 13:20:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:19,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 13:20:19,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:19,318 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-13 13:20:19,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-13 13:20:19,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:20:19,458 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:20:19,458 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-11-13 13:20:19,491 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 27 treesize of output 15 [2024-11-13 13:20:19,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:19,591 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:19,591 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:19,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559290268] [2024-11-13 13:20:19,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559290268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:19,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:19,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:20:19,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383031951] [2024-11-13 13:20:19,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:19,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:20:19,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:19,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:20:19,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:20:19,593 INFO L87 Difference]: Start difference. First operand 152 states and 169 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:20,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:20,932 INFO L93 Difference]: Finished difference Result 166 states and 185 transitions. [2024-11-13 13:20:20,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:20:20,933 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-13 13:20:20,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:20,934 INFO L225 Difference]: With dead ends: 166 [2024-11-13 13:20:20,934 INFO L226 Difference]: Without dead ends: 166 [2024-11-13 13:20:20,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-13 13:20:20,935 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 169 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:20,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 275 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 13:20:20,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-13 13:20:20,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 151. [2024-11-13 13:20:20,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 149 states have internal predecessors, (162), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:20,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 168 transitions. [2024-11-13 13:20:20,940 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 168 transitions. Word has length 16 [2024-11-13 13:20:20,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:20,941 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 168 transitions. [2024-11-13 13:20:20,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:20,941 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 168 transitions. [2024-11-13 13:20:20,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 13:20:20,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:20,942 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:20,960 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-13 13:20:21,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:21,142 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:20:21,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:21,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1072257331, now seen corresponding path program 1 times [2024-11-13 13:20:21,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:21,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1761280295] [2024-11-13 13:20:21,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:21,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:21,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:21,146 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:21,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 13:20:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:21,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 13:20:21,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:21,249 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-11-13 13:20:21,256 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-11-13 13:20:21,274 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 21 treesize of output 20 [2024-11-13 13:20:21,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-13 13:20:21,328 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 27 treesize of output 11 [2024-11-13 13:20:21,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2024-11-13 13:20:21,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:21,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:20:21,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:21,716 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:21,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761280295] [2024-11-13 13:20:21,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761280295] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:20:21,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:20:21,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2024-11-13 13:20:21,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183943554] [2024-11-13 13:20:21,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:20:21,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:20:21,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:21,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:20:21,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:20:21,717 INFO L87 Difference]: Start difference. First operand 151 states and 168 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-11-13 13:20:22,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:22,549 INFO L93 Difference]: Finished difference Result 189 states and 212 transitions. [2024-11-13 13:20:22,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:20:22,550 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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) Word has length 21 [2024-11-13 13:20:22,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:22,551 INFO L225 Difference]: With dead ends: 189 [2024-11-13 13:20:22,551 INFO L226 Difference]: Without dead ends: 189 [2024-11-13 13:20:22,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-13 13:20:22,552 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 116 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:22,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 362 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 13:20:22,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-13 13:20:22,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 158. [2024-11-13 13:20:22,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 122 states have (on average 1.3934426229508197) internal successors, (170), 156 states have internal predecessors, (170), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:22,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 176 transitions. [2024-11-13 13:20:22,558 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 176 transitions. Word has length 21 [2024-11-13 13:20:22,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:22,558 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 176 transitions. [2024-11-13 13:20:22,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-11-13 13:20:22,559 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 176 transitions. [2024-11-13 13:20:22,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 13:20:22,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:22,559 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:22,576 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 13:20:22,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:22,760 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:20:22,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:22,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1872644597, now seen corresponding path program 1 times [2024-11-13 13:20:22,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:22,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1888506635] [2024-11-13 13:20:22,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:22,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:22,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:22,763 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:22,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 13:20:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:22,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 13:20:22,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:22,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:22,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:22,907 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:22,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888506635] [2024-11-13 13:20:22,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888506635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:22,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:22,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:20:22,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40596765] [2024-11-13 13:20:22,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:22,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:20:22,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:22,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:20:22,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:20:22,908 INFO L87 Difference]: Start difference. First operand 158 states and 176 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-11-13 13:20:23,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:23,371 INFO L93 Difference]: Finished difference Result 161 states and 177 transitions. [2024-11-13 13:20:23,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:20:23,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) Word has length 22 [2024-11-13 13:20:23,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:23,373 INFO L225 Difference]: With dead ends: 161 [2024-11-13 13:20:23,373 INFO L226 Difference]: Without dead ends: 161 [2024-11-13 13:20:23,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:20:23,374 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 18 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:23,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 335 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:20:23,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-13 13:20:23,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2024-11-13 13:20:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 121 states have (on average 1.3801652892561984) internal successors, (167), 155 states have internal predecessors, (167), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:23,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 173 transitions. [2024-11-13 13:20:23,380 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 173 transitions. Word has length 22 [2024-11-13 13:20:23,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:23,380 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 173 transitions. [2024-11-13 13:20:23,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-11-13 13:20:23,380 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 173 transitions. [2024-11-13 13:20:23,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 13:20:23,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:23,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:23,398 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 13:20:23,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:23,586 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:20:23,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:23,586 INFO L85 PathProgramCache]: Analyzing trace with hash 823561326, now seen corresponding path program 1 times [2024-11-13 13:20:23,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:23,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [480213115] [2024-11-13 13:20:23,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:23,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:23,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:23,588 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:23,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 13:20:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:23,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 13:20:23,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:23,711 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 13 treesize of output 9 [2024-11-13 13:20:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:23,736 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:23,736 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:23,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480213115] [2024-11-13 13:20:23,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480213115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:23,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:23,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:20:23,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699441162] [2024-11-13 13:20:23,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:23,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:20:23,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:23,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:20:23,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:20:23,737 INFO L87 Difference]: Start difference. First operand 157 states and 173 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:24,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:24,054 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2024-11-13 13:20:24,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:20:24,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-13 13:20:24,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:24,056 INFO L225 Difference]: With dead ends: 160 [2024-11-13 13:20:24,056 INFO L226 Difference]: Without dead ends: 160 [2024-11-13 13:20:24,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:20:24,057 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 15 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:24,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 286 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:20:24,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-13 13:20:24,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2024-11-13 13:20:24,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 121 states have (on average 1.3636363636363635) internal successors, (165), 154 states have internal predecessors, (165), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:24,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2024-11-13 13:20:24,062 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 24 [2024-11-13 13:20:24,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:24,062 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2024-11-13 13:20:24,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:24,063 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2024-11-13 13:20:24,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 13:20:24,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:24,063 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:24,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 13:20:24,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:24,264 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:20:24,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:24,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1085080456, now seen corresponding path program 1 times [2024-11-13 13:20:24,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:24,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1729521234] [2024-11-13 13:20:24,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:24,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:24,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:24,268 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:24,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 13:20:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:24,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 13:20:24,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:24,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-13 13:20:24,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:20:24,422 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 19 treesize of output 11 [2024-11-13 13:20:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:24,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:24,433 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:24,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729521234] [2024-11-13 13:20:24,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729521234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:24,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:24,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:20:24,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132179446] [2024-11-13 13:20:24,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:24,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:20:24,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:24,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:20:24,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:20:24,434 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-11-13 13:20:24,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:24,914 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2024-11-13 13:20:24,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:20:24,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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) Word has length 24 [2024-11-13 13:20:24,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:24,916 INFO L225 Difference]: With dead ends: 155 [2024-11-13 13:20:24,916 INFO L226 Difference]: Without dead ends: 155 [2024-11-13 13:20:24,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:20:24,917 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 3 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:24,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 321 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 13:20:24,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-13 13:20:24,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-13 13:20:24,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 121 states have (on average 1.3553719008264462) internal successors, (164), 153 states have internal predecessors, (164), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:24,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 169 transitions. [2024-11-13 13:20:24,922 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 169 transitions. Word has length 24 [2024-11-13 13:20:24,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:24,922 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 169 transitions. [2024-11-13 13:20:24,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-11-13 13:20:24,923 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 169 transitions. [2024-11-13 13:20:24,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 13:20:24,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:24,925 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:24,948 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 13:20:25,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:25,126 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:20:25,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:25,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1085080457, now seen corresponding path program 1 times [2024-11-13 13:20:25,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:25,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [732151540] [2024-11-13 13:20:25,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:25,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:25,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:25,128 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:25,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 13:20:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:25,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 13:20:25,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:25,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-13 13:20:25,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:20:25,279 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-11-13 13:20:25,314 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 17 treesize of output 9 [2024-11-13 13:20:25,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:25,341 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:25,341 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:25,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732151540] [2024-11-13 13:20:25,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732151540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:25,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:25,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:20:25,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475031527] [2024-11-13 13:20:25,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:25,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:20:25,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:25,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:20:25,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:20:25,342 INFO L87 Difference]: Start difference. First operand 155 states and 169 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-11-13 13:20:25,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:25,790 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2024-11-13 13:20:25,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:20:25,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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) Word has length 24 [2024-11-13 13:20:25,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:25,793 INFO L225 Difference]: With dead ends: 154 [2024-11-13 13:20:25,793 INFO L226 Difference]: Without dead ends: 154 [2024-11-13 13:20:25,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:20:25,794 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:25,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 311 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:20:25,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-13 13:20:25,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-13 13:20:25,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 121 states have (on average 1.3471074380165289) internal successors, (163), 152 states have internal predecessors, (163), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:25,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2024-11-13 13:20:25,798 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 24 [2024-11-13 13:20:25,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:25,799 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2024-11-13 13:20:25,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-11-13 13:20:25,799 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2024-11-13 13:20:25,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 13:20:25,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:25,800 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:25,821 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-13 13:20:26,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:26,000 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:20:26,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:26,001 INFO L85 PathProgramCache]: Analyzing trace with hash -301785554, now seen corresponding path program 1 times [2024-11-13 13:20:26,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:26,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [764799758] [2024-11-13 13:20:26,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:26,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:26,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:26,004 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:26,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-13 13:20:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:26,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 13:20:26,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:26,155 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-11-13 13:20:26,162 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-11-13 13:20:26,195 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 27 treesize of output 11 [2024-11-13 13:20:26,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-13 13:20:26,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:26,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:26,252 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:26,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764799758] [2024-11-13 13:20:26,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764799758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:26,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:26,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:20:26,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443172241] [2024-11-13 13:20:26,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:26,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:20:26,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:26,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:20:26,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:20:26,255 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:26,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:26,573 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2024-11-13 13:20:26,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:20:26,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-13 13:20:26,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:26,575 INFO L225 Difference]: With dead ends: 154 [2024-11-13 13:20:26,575 INFO L226 Difference]: Without dead ends: 154 [2024-11-13 13:20:26,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:20:26,575 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 11 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:26,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 261 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:20:26,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-13 13:20:26,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2024-11-13 13:20:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 121 states have (on average 1.3305785123966942) internal successors, (161), 151 states have internal predecessors, (161), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2024-11-13 13:20:26,580 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 27 [2024-11-13 13:20:26,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:26,580 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2024-11-13 13:20:26,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:26,581 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2024-11-13 13:20:26,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 13:20:26,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:26,581 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:26,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-13 13:20:26,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:26,782 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:20:26,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:26,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1133425020, now seen corresponding path program 1 times [2024-11-13 13:20:26,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:26,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [942971538] [2024-11-13 13:20:26,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:26,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:26,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:26,785 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:26,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-13 13:20:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:26,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 13:20:26,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:20:26,961 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:26,962 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:26,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942971538] [2024-11-13 13:20:26,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942971538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:26,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:26,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:20:26,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157812675] [2024-11-13 13:20:26,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:26,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:20:26,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:26,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:20:26,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:20:26,963 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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-11-13 13:20:27,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:27,076 INFO L93 Difference]: Finished difference Result 155 states and 167 transitions. [2024-11-13 13:20:27,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:20:27,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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) Word has length 27 [2024-11-13 13:20:27,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:27,078 INFO L225 Difference]: With dead ends: 155 [2024-11-13 13:20:27,078 INFO L226 Difference]: Without dead ends: 155 [2024-11-13 13:20:27,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:20:27,078 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 64 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:27,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 121 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:20:27,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-13 13:20:27,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-13 13:20:27,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 123 states have (on average 1.3252032520325203) internal successors, (163), 153 states have internal predecessors, (163), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:27,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 167 transitions. [2024-11-13 13:20:27,084 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 167 transitions. Word has length 27 [2024-11-13 13:20:27,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:27,084 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 167 transitions. [2024-11-13 13:20:27,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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-11-13 13:20:27,084 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 167 transitions. [2024-11-13 13:20:27,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 13:20:27,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:27,085 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:27,105 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-13 13:20:27,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:27,286 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:20:27,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:27,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1989507427, now seen corresponding path program 1 times [2024-11-13 13:20:27,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:27,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [548074001] [2024-11-13 13:20:27,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:27,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:27,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:27,289 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:27,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-13 13:20:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:27,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 13:20:27,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:27,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2024-11-13 13:20:27,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2024-11-13 13:20:27,482 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 13:20:27,483 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 13 treesize of output 13 [2024-11-13 13:20:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:27,508 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:27,508 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:27,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548074001] [2024-11-13 13:20:27,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548074001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:27,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:27,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:20:27,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770401801] [2024-11-13 13:20:27,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:27,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:20:27,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:27,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:20:27,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:20:27,509 INFO L87 Difference]: Start difference. First operand 155 states and 167 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:27,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:27,768 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2024-11-13 13:20:27,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:20:27,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-13 13:20:27,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:27,769 INFO L225 Difference]: With dead ends: 155 [2024-11-13 13:20:27,769 INFO L226 Difference]: Without dead ends: 155 [2024-11-13 13:20:27,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:20:27,769 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 129 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:27,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 94 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:20:27,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-13 13:20:27,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2024-11-13 13:20:27,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 152 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:27,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2024-11-13 13:20:27,774 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 29 [2024-11-13 13:20:27,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:27,774 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2024-11-13 13:20:27,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:27,774 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2024-11-13 13:20:27,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 13:20:27,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:27,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:27,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-13 13:20:27,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:27,976 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:20:27,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:27,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1409531466, now seen corresponding path program 1 times [2024-11-13 13:20:27,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:27,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1329059859] [2024-11-13 13:20:27,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:27,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:27,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:27,978 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:27,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-13 13:20:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:28,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 13:20:28,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:28,154 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-13 13:20:28,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-13 13:20:28,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:20:28,263 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:20:28,263 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-11-13 13:20:28,306 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 27 treesize of output 15 [2024-11-13 13:20:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:28,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:28,369 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:28,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329059859] [2024-11-13 13:20:28,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329059859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:28,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:28,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:20:28,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669556933] [2024-11-13 13:20:28,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:28,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:20:28,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:28,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:20:28,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:20:28,370 INFO L87 Difference]: Start difference. First operand 154 states and 164 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:29,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:29,072 INFO L93 Difference]: Finished difference Result 160 states and 170 transitions. [2024-11-13 13:20:29,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:20:29,073 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-13 13:20:29,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:29,073 INFO L225 Difference]: With dead ends: 160 [2024-11-13 13:20:29,074 INFO L226 Difference]: Without dead ends: 160 [2024-11-13 13:20:29,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:20:29,074 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 47 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:29,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 304 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 13:20:29,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-13 13:20:29,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 153. [2024-11-13 13:20:29,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 123 states have (on average 1.3008130081300813) internal successors, (160), 151 states have internal predecessors, (160), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:29,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 163 transitions. [2024-11-13 13:20:29,079 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 163 transitions. Word has length 28 [2024-11-13 13:20:29,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:29,079 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 163 transitions. [2024-11-13 13:20:29,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:29,079 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 163 transitions. [2024-11-13 13:20:29,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 13:20:29,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:29,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:29,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-13 13:20:29,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:29,281 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:20:29,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:29,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1409531467, now seen corresponding path program 1 times [2024-11-13 13:20:29,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:29,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1338994717] [2024-11-13 13:20:29,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:29,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:29,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:29,283 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:29,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-13 13:20:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:29,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 13:20:29,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:29,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-13 13:20:29,452 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 13:20:29,452 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 13 treesize of output 13 [2024-11-13 13:20:29,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:20:29,481 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-11-13 13:20:29,572 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:20:29,573 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-13 13:20:29,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 13:20:29,609 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 25 treesize of output 13 [2024-11-13 13:20:29,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 13:20:29,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:29,655 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:29,655 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:29,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338994717] [2024-11-13 13:20:29,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338994717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:29,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:29,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:20:29,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100713923] [2024-11-13 13:20:29,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:29,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:20:29,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:29,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:20:29,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:20:29,656 INFO L87 Difference]: Start difference. First operand 153 states and 163 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:30,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:30,729 INFO L93 Difference]: Finished difference Result 148 states and 158 transitions. [2024-11-13 13:20:30,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:20:30,730 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-13 13:20:30,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:30,731 INFO L225 Difference]: With dead ends: 148 [2024-11-13 13:20:30,731 INFO L226 Difference]: Without dead ends: 148 [2024-11-13 13:20:30,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-13 13:20:30,732 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 53 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:30,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 412 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 13:20:30,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-13 13:20:30,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 130. [2024-11-13 13:20:30,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 107 states have (on average 1.2710280373831775) internal successors, (136), 128 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2024-11-13 13:20:30,737 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 28 [2024-11-13 13:20:30,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:30,737 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2024-11-13 13:20:30,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:30,737 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2024-11-13 13:20:30,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 13:20:30,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:30,738 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:30,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-13 13:20:30,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:30,939 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:20:30,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:30,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1700239361, now seen corresponding path program 1 times [2024-11-13 13:20:30,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:30,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [972603490] [2024-11-13 13:20:30,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:30,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:30,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:30,942 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:30,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-13 13:20:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:31,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 13:20:31,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:31,050 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 13 treesize of output 9 [2024-11-13 13:20:31,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:20:31,111 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:31,111 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:31,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972603490] [2024-11-13 13:20:31,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972603490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:31,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:20:31,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:20:31,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68635465] [2024-11-13 13:20:31,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:31,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:20:31,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:31,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:20:31,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:20:31,112 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-11-13 13:20:31,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:31,319 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2024-11-13 13:20:31,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:20:31,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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) Word has length 29 [2024-11-13 13:20:31,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:31,320 INFO L225 Difference]: With dead ends: 137 [2024-11-13 13:20:31,320 INFO L226 Difference]: Without dead ends: 137 [2024-11-13 13:20:31,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:20:31,320 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 5 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:31,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 263 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:20:31,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-13 13:20:31,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2024-11-13 13:20:31,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 110 states have (on average 1.2636363636363637) internal successors, (139), 131 states have internal predecessors, (139), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:31,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2024-11-13 13:20:31,324 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 29 [2024-11-13 13:20:31,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:31,324 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2024-11-13 13:20:31,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-11-13 13:20:31,324 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2024-11-13 13:20:31,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 13:20:31,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:31,324 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2024-11-13 13:20:31,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-11-13 13:20:31,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:31,525 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:20:31,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:31,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1515355891, now seen corresponding path program 1 times [2024-11-13 13:20:31,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:31,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1395294197] [2024-11-13 13:20:31,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:31,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:31,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:31,527 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:31,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-13 13:20:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:31,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-13 13:20:31,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:31,638 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 8 treesize of output 1 [2024-11-13 13:20:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:31,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:20:32,006 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-13 13:20:32,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 23 [2024-11-13 13:20:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:32,121 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:32,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395294197] [2024-11-13 13:20:32,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395294197] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:20:32,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:20:32,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2024-11-13 13:20:32,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756262569] [2024-11-13 13:20:32,121 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:20:32,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 13:20:32,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:32,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 13:20:32,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-13 13:20:32,122 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 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-11-13 13:20:33,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:33,307 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2024-11-13 13:20:33,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:20:33,312 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 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) Word has length 30 [2024-11-13 13:20:33,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:33,312 INFO L225 Difference]: With dead ends: 157 [2024-11-13 13:20:33,312 INFO L226 Difference]: Without dead ends: 157 [2024-11-13 13:20:33,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-11-13 13:20:33,314 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 53 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:33,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 497 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 13:20:33,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-13 13:20:33,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 144. [2024-11-13 13:20:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 121 states have (on average 1.256198347107438) internal successors, (152), 142 states have internal predecessors, (152), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2024-11-13 13:20:33,319 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 30 [2024-11-13 13:20:33,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:33,319 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2024-11-13 13:20:33,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 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-11-13 13:20:33,320 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2024-11-13 13:20:33,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 13:20:33,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:33,320 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:33,342 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-13 13:20:33,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:33,521 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:20:33,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:33,521 INFO L85 PathProgramCache]: Analyzing trace with hash -268607987, now seen corresponding path program 1 times [2024-11-13 13:20:33,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:33,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1560424042] [2024-11-13 13:20:33,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:33,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:33,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:33,523 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:33,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-13 13:20:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:33,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 13:20:33,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:33,771 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~list~0#1.base_37| (_ BitVec 32))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~list~0#1.base_37|) (_ bv0 1)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~list~0#1.base_37| (_ bv0 1)) |c_#valid|))) is different from true [2024-11-13 13:20:33,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2024-11-13 13:20:33,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:20:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:20:33,911 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:33,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560424042] [2024-11-13 13:20:33,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560424042] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:20:33,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:20:33,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2024-11-13 13:20:33,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885556715] [2024-11-13 13:20:33,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:20:33,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:20:33,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:33,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:20:33,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-11-13 13:20:33,912 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 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-11-13 13:20:34,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:34,249 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2024-11-13 13:20:34,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:20:34,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 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) Word has length 31 [2024-11-13 13:20:34,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:34,250 INFO L225 Difference]: With dead ends: 152 [2024-11-13 13:20:34,250 INFO L226 Difference]: Without dead ends: 129 [2024-11-13 13:20:34,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2024-11-13 13:20:34,250 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:34,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 130 Unchecked, 0.3s Time] [2024-11-13 13:20:34,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-13 13:20:34,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-13 13:20:34,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 106 states have (on average 1.2830188679245282) internal successors, (136), 127 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:34,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2024-11-13 13:20:34,254 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 31 [2024-11-13 13:20:34,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:34,254 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2024-11-13 13:20:34,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 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-11-13 13:20:34,254 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2024-11-13 13:20:34,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 13:20:34,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:34,254 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:34,269 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-11-13 13:20:34,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:34,456 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:20:34,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:34,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1278929291, now seen corresponding path program 1 times [2024-11-13 13:20:34,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:34,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [994020954] [2024-11-13 13:20:34,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:34,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:34,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:34,458 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:34,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-13 13:20:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:34,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-13 13:20:34,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:34,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-13 13:20:34,646 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-11-13 13:20:34,744 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 13:20:34,744 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 13 treesize of output 13 [2024-11-13 13:20:34,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:20:34,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 13:20:34,929 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:20:34,929 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-13 13:20:34,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 13:20:34,975 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 16 treesize of output 8 [2024-11-13 13:20:35,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:20:35,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:20:35,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:35,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:20:35,267 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_824 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_824) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2024-11-13 13:20:35,289 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_824 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_824) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2024-11-13 13:20:35,364 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_821 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_822) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_821) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_824) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2024-11-13 13:20:35,376 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_821 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int#1| .cse0 v_ArrVal_822) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_821) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_824)) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2024-11-13 13:20:35,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:35,401 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2024-11-13 13:20:35,409 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 60 treesize of output 52 [2024-11-13 13:20:35,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-13 13:20:35,563 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (or .cse0 (forall ((v_ArrVal_819 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_824 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_824) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (not (= v_ArrVal_819 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_819 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) (or (forall ((v_ArrVal_819 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_824 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_ArrVal_822 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_819 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_819 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822) v_arrayElimCell_52 v_ArrVal_824) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (not .cse0)) (forall ((v_ArrVal_819 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_824 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_819))) (or (= (select (select (store .cse3 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_824) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (forall ((v_arrayElimCell_52 (_ BitVec 32)) (v_ArrVal_822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store .cse3 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822) v_arrayElimCell_52 v_ArrVal_824) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) (not (= v_ArrVal_819 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_819 |c_ULTIMATE.start_main_~end~0#1.offset|)))))))) is different from false [2024-11-13 13:20:36,314 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 165 treesize of output 163 [2024-11-13 13:20:36,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-11-13 13:20:36,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 13:20:36,344 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:20:36,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-13 13:20:36,354 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:20:36,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 1 [2024-11-13 13:20:36,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:36,406 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:36,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994020954] [2024-11-13 13:20:36,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994020954] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:20:36,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:20:36,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2024-11-13 13:20:36,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572590337] [2024-11-13 13:20:36,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:20:36,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-13 13:20:36,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:36,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-13 13:20:36,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=262, Unknown=19, NotChecked=190, Total=552 [2024-11-13 13:20:36,408 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:38,022 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_13| (_ BitVec 32))) (or (forall ((v_ArrVal_819 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_824 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_819 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_819 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_819) |v_ULTIMATE.start_main_#t~malloc3#1.base_13| v_ArrVal_824) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_13| |c_ULTIMATE.start_main_~end~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) (_ bv0 1))))) (= (_ bv1 32) (select .cse0 (bvadd |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv8 32)))) (or .cse2 (forall ((v_ArrVal_819 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_824 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_824) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (not (= v_ArrVal_819 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_819 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|))) (not (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (or (forall ((v_ArrVal_819 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_824 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_ArrVal_822 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_819 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_819 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822) v_arrayElimCell_52 v_ArrVal_824) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (not .cse2)) (= (_ bv0 32) |c_ULTIMATE.start_main_~list~0#1.offset|) (or (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base|))) (forall ((v_ArrVal_824 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_52 (_ BitVec 32)) (v_ArrVal_822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_822) v_arrayElimCell_52 v_ArrVal_824) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_13| (_ BitVec 32))) (or (forall ((v_ArrVal_819 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_819 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_819 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_ArrVal_824 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_819))) (or (forall ((v_arrayElimCell_52 (_ BitVec 32)) (v_ArrVal_822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store .cse3 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| v_ArrVal_822) v_arrayElimCell_52 v_ArrVal_824) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= (_ bv1 32) (select (select (store .cse3 |v_ULTIMATE.start_main_#t~malloc3#1.base_13| v_ArrVal_824) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_13|) (_ bv0 1))))) (= (_ bv1 32) (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base|) (_ bv8 32))) (forall ((v_ArrVal_819 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_824 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_819))) (or (= (select (select (store .cse4 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_824) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (forall ((v_arrayElimCell_52 (_ BitVec 32)) (v_ArrVal_822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store .cse4 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_822) v_arrayElimCell_52 v_ArrVal_824) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) (not (= v_ArrVal_819 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_819 |c_ULTIMATE.start_main_~end~0#1.offset|)))))))) is different from false [2024-11-13 13:20:40,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:40,439 INFO L93 Difference]: Finished difference Result 355 states and 393 transitions. [2024-11-13 13:20:40,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 13:20:40,440 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-13 13:20:40,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:40,442 INFO L225 Difference]: With dead ends: 355 [2024-11-13 13:20:40,442 INFO L226 Difference]: Without dead ends: 355 [2024-11-13 13:20:40,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=241, Invalid=752, Unknown=23, NotChecked=390, Total=1406 [2024-11-13 13:20:40,443 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 470 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 50 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 2511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 1638 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:40,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 790 Invalid, 2511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 815 Invalid, 8 Unknown, 1638 Unchecked, 3.1s Time] [2024-11-13 13:20:40,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-13 13:20:40,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 176. [2024-11-13 13:20:40,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 153 states have (on average 1.2222222222222223) internal successors, (187), 174 states have internal predecessors, (187), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:40,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 190 transitions. [2024-11-13 13:20:40,450 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 190 transitions. Word has length 37 [2024-11-13 13:20:40,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:40,450 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 190 transitions. [2024-11-13 13:20:40,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:40,451 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 190 transitions. [2024-11-13 13:20:40,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 13:20:40,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:40,451 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:40,473 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-11-13 13:20:40,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:40,652 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:20:40,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:40,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1983957768, now seen corresponding path program 1 times [2024-11-13 13:20:40,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:40,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [128605734] [2024-11-13 13:20:40,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:40,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:40,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:40,657 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:40,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-13 13:20:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:40,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-13 13:20:40,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:40,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-13 13:20:40,896 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 13:20:40,896 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 13 treesize of output 13 [2024-11-13 13:20:40,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:20:40,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:20:40,975 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-11-13 13:20:41,108 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:20:41,108 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-13 13:20:41,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 13:20:41,252 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 13:20:41,253 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-13 13:20:41,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-13 13:20:41,280 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:20:41,280 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 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-13 13:20:41,358 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:20:41,358 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-13 13:20:41,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 13:20:41,611 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 25 treesize of output 13 [2024-11-13 13:20:41,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 13:20:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:41,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:20:42,157 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_881 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_882) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_881) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_ArrVal_882 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_882) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0))))) is different from false [2024-11-13 13:20:42,417 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_882 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_882) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_881 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_882) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_881) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) is different from false [2024-11-13 13:20:42,467 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_878 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_878) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_877) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_882) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_878 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_877))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_878) .cse1 v_ArrVal_882) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_881) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) is different from false [2024-11-13 13:20:42,502 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_878 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_878) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_877) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_882) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_878 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_877))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_878) .cse2 v_ArrVal_882) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_881) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))))) is different from false [2024-11-13 13:20:42,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:42,541 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-11-13 13:20:42,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:42,552 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-13 13:20:42,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:42,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 632 treesize of output 567 [2024-11-13 13:20:42,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:42,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1127 treesize of output 1070 [2024-11-13 13:20:42,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 547 treesize of output 523 [2024-11-13 13:20:42,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 523 treesize of output 499 [2024-11-13 13:20:42,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:42,737 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 499 treesize of output 455 [2024-11-13 13:20:42,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 447 treesize of output 439 [2024-11-13 13:20:45,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:45,086 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-13 13:20:45,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:45,099 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-13 13:20:45,112 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 84 treesize of output 72 [2024-11-13 13:20:45,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:45,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 232 treesize of output 215 [2024-11-13 13:20:45,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 74 [2024-11-13 13:20:45,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 96 [2024-11-13 13:20:45,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2024-11-13 13:20:45,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:45,599 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:20:45,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128605734] [2024-11-13 13:20:45,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128605734] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:20:45,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:20:45,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2024-11-13 13:20:45,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773401144] [2024-11-13 13:20:45,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:20:45,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-13 13:20:45,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:20:45,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-13 13:20:45,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=16, NotChecked=156, Total=552 [2024-11-13 13:20:45,601 INFO L87 Difference]: Start difference. First operand 176 states and 190 transitions. Second operand has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 24 states have internal predecessors, (79), 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-11-13 13:20:49,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:49,791 INFO L93 Difference]: Finished difference Result 237 states and 260 transitions. [2024-11-13 13:20:49,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 13:20:49,792 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 24 states have internal predecessors, (79), 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) Word has length 42 [2024-11-13 13:20:49,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:49,793 INFO L225 Difference]: With dead ends: 237 [2024-11-13 13:20:49,793 INFO L226 Difference]: Without dead ends: 237 [2024-11-13 13:20:49,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=196, Invalid=917, Unknown=25, NotChecked=268, Total=1406 [2024-11-13 13:20:49,794 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 361 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 1753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 809 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:49,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 510 Invalid, 1753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 907 Invalid, 0 Unknown, 809 Unchecked, 3.1s Time] [2024-11-13 13:20:49,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-13 13:20:49,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 192. [2024-11-13 13:20:49,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 169 states have (on average 1.2189349112426036) internal successors, (206), 190 states have internal predecessors, (206), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:20:49,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 209 transitions. [2024-11-13 13:20:49,803 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 209 transitions. Word has length 42 [2024-11-13 13:20:49,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:49,803 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 209 transitions. [2024-11-13 13:20:49,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 24 states have internal predecessors, (79), 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-11-13 13:20:49,804 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 209 transitions. [2024-11-13 13:20:49,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 13:20:49,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:49,804 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:49,821 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-11-13 13:20:50,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:50,005 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:20:50,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:50,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1983957767, now seen corresponding path program 1 times [2024-11-13 13:20:50,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:20:50,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1151614137] [2024-11-13 13:20:50,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:50,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:50,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:50,007 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:50,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-13 13:20:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:50,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 13:20:50,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:50,226 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-13 13:20:50,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-13 13:20:50,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:20:50,407 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:20:50,408 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-11-13 13:20:50,527 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:20:50,527 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 1 case distinctions, treesize of input 35 treesize of output 26 [2024-11-13 13:20:50,600 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:20:50,600 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-11-13 13:20:50,821 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 27 treesize of output 15 [2024-11-13 13:20:50,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:20:50,921 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:20:51,101 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_934 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_934) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2024-11-13 13:20:51,207 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_934 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_934) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2024-11-13 13:20:51,225 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_934 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_932 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_932))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_934)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2024-11-13 13:20:51,240 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_934 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_932 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_932))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_934)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (_ bv0 1))) is different from false [2024-11-13 13:20:51,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:51,260 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2024-11-13 13:20:51,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:51,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 268 treesize of output 243 [2024-11-13 13:20:51,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 179 [2024-11-13 13:20:51,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:20:51,319 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 179 treesize of output 175 [2024-11-13 13:21:16,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:21:16,731 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:21:16,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151614137] [2024-11-13 13:21:16,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151614137] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:21:16,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:21:16,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2024-11-13 13:21:16,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607973914] [2024-11-13 13:21:16,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:21:16,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-13 13:21:16,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:21:16,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-13 13:21:16,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=325, Unknown=11, NotChecked=164, Total=600 [2024-11-13 13:21:16,732 INFO L87 Difference]: Start difference. First operand 192 states and 209 transitions. Second operand has 25 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 25 states have internal predecessors, (82), 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-11-13 13:21:22,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:21:22,901 INFO L93 Difference]: Finished difference Result 261 states and 285 transitions. [2024-11-13 13:21:22,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 13:21:22,902 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 25 states have internal predecessors, (82), 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) Word has length 42 [2024-11-13 13:21:22,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:21:22,903 INFO L225 Difference]: With dead ends: 261 [2024-11-13 13:21:22,903 INFO L226 Difference]: Without dead ends: 261 [2024-11-13 13:21:22,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 29.1s TimeCoverageRelationStatistics Valid=155, Invalid=499, Unknown=12, NotChecked=204, Total=870 [2024-11-13 13:21:22,904 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 425 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 919 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:21:22,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 365 Invalid, 1646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 681 Invalid, 0 Unknown, 919 Unchecked, 1.9s Time] [2024-11-13 13:21:22,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-13 13:21:22,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 192. [2024-11-13 13:21:22,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 169 states have (on average 1.21301775147929) internal successors, (205), 190 states have internal predecessors, (205), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:21:22,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 208 transitions. [2024-11-13 13:21:22,909 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 208 transitions. Word has length 42 [2024-11-13 13:21:22,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:21:22,909 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 208 transitions. [2024-11-13 13:21:22,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 25 states have internal predecessors, (82), 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-11-13 13:21:22,910 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 208 transitions. [2024-11-13 13:21:22,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-13 13:21:22,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:21:22,910 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:21:22,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-11-13 13:21:23,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:23,114 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:21:23,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:21:23,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1482811008, now seen corresponding path program 1 times [2024-11-13 13:21:23,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:21:23,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [538375557] [2024-11-13 13:21:23,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:23,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:23,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:21:23,117 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:21:23,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-13 13:21:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:23,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 13:21:23,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:21:23,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-13 13:21:23,309 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-11-13 13:21:23,384 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 13:21:23,384 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 13 treesize of output 13 [2024-11-13 13:21:23,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 13:21:23,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:21:23,582 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:21:23,582 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-13 13:21:23,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 13:21:23,629 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 16 treesize of output 8 [2024-11-13 13:21:23,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:21:23,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:21:23,833 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-13 13:21:23,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-13 13:21:23,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:21:23,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:21:24,111 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:21:24,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2024-11-13 13:21:24,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-13 13:21:24,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-13 13:21:24,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:21:24,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:21:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:21:24,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:21:24,495 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2024-11-13 13:21:24,581 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv1 32))) is different from false [2024-11-13 13:21:24,595 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1020) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2024-11-13 13:21:24,605 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int#1| .cse0 v_ArrVal_1020) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1021) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1023)) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2024-11-13 13:21:24,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:21:24,621 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2024-11-13 13:21:24,624 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 60 treesize of output 52 [2024-11-13 13:21:24,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-13 13:21:26,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:21:26,376 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 141 [2024-11-13 13:21:26,385 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 265 treesize of output 241 [2024-11-13 13:21:26,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 221 [2024-11-13 13:21:27,404 INFO L349 Elim1Store]: treesize reduction 4, result has 97.5 percent of original size [2024-11-13 13:21:27,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 230 treesize of output 370 [2024-11-13 13:21:27,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 244 treesize of output 232 [2024-11-13 13:22:12,006 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse8 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))))) (.cse7 (not .cse0)) (.cse4 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse45 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24))) (or (= (select (select (store .cse45 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store .cse45 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))))) (and (or .cse0 (and (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))) (= v_arrayElimCell_114 v_prenex_20))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) .cse4)) (or (and (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (_ bv1 32) (select (select (store .cse5 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse5 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))) (= v_arrayElimCell_114 v_prenex_20))) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)))))) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 v_prenex_20))) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|)))))) .cse7) (or .cse0 (and .cse8 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (= v_arrayElimCell_121 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32))) (or (forall ((v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|))))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24))) (or (= (select (select (store .cse10 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse10 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_114 v_prenex_20))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (or .cse0 (and .cse8 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (= v_arrayElimCell_121 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)))))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse14 (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (select (select (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= (_ bv1 32) (select (select (store .cse14 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse14 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 v_prenex_20))))) .cse7) (or .cse0 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= (_ bv1 32) (select (select (store (store (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 v_prenex_20))))) (or .cse0 (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))) (or (and (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (_ bv1 32) (select (select (store .cse16 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse16 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_114 v_prenex_20)))) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (_ bv1 32) (select (select (store (store (store .cse17 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store (store .cse17 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_114 v_prenex_20)))) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012))))) .cse7) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse19 (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (select (select (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= (_ bv1 32) (select (select (store .cse19 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse19 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 v_prenex_20))))) .cse7) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_arrayElimCell_121 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) .cse7) (or (and (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)))))) (= v_arrayElimCell_114 v_prenex_20))) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (_ bv1 32) (select (select (store .cse21 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse21 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))) (= v_arrayElimCell_114 v_prenex_20))) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012))))) .cse7) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) .cse7) (or .cse0 (and .cse8 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse22 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse22 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|))))))) (or .cse0 (and .cse8 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (= v_arrayElimCell_121 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32))) (or (forall ((v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse23 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse23 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|))))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse24 (store .cse25 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24))) (or (= (select (select (store .cse24 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse25 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store .cse24 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))))) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= v_arrayElimCell_114 v_prenex_20))))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse26 (store .cse27 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24))) (or (= (select (select (store .cse26 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse27 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store .cse26 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))))) (= v_arrayElimCell_114 v_prenex_20))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (or .cse0 (and .cse4 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse28 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store (store .cse28 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse29 (store .cse30 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24))) (or (= (select (select (store .cse29 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse30 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store .cse29 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))))) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)))))) (or .cse0 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24))) (or (= (select (select (store .cse31 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= (_ bv1 32) (select (select (store (store .cse31 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (or .cse0 (and .cse8 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= v_arrayElimCell_121 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse32 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse32 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= v_arrayElimCell_121 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse33 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse33 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))))) (or .cse0 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse34 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= (_ bv1 32) (select (select (store (store (store (store .cse34 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 v_prenex_20))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= v_arrayElimCell_121 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse35 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse35 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)))) (or .cse0 (and .cse4 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse36 (store .cse37 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24))) (or (= (select (select (store .cse36 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (_ bv1 32) (select (select (store (store (store .cse37 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse36 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse38 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= (_ bv1 32) (select (select (store (store (store (store .cse38 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))))) (or (and (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (_ bv1 32) (select (select (store (store (store .cse39 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store (store .cse39 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_114 v_prenex_20)))) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse40 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (_ bv1 32) (select (select (store .cse40 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse40 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_114 v_prenex_20))))))))) .cse7) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse41 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse41 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))))) (or .cse0 (and .cse4 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse42 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= (_ bv1 32) (select (select (store (store (store (store .cse42 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_114 v_prenex_20)))))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse43 (store .cse44 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24))) (or (= (select (select (store .cse43 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (_ bv1 32) (select (select (store (store (store .cse44 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse43 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= v_arrayElimCell_114 v_prenex_20))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012))))))) is different from false [2024-11-13 13:22:16,036 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse8 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))))) (.cse7 (not .cse0)) (.cse4 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse45 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24))) (or (= (select (select (store .cse45 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store .cse45 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))))) (and (or .cse0 (and (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))) (= v_arrayElimCell_114 v_prenex_20))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) .cse4)) (or (and (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (_ bv1 32) (select (select (store .cse5 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse5 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))) (= v_arrayElimCell_114 v_prenex_20))) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)))))) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 v_prenex_20))) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|)))))) .cse7) (or .cse0 (and .cse8 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (= v_arrayElimCell_121 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32))) (or (forall ((v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|))))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24))) (or (= (select (select (store .cse10 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse10 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_114 v_prenex_20))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (or .cse0 (and .cse8 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (= v_arrayElimCell_121 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)))))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse14 (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (select (select (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= (_ bv1 32) (select (select (store .cse14 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse14 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 v_prenex_20))))) .cse7) (or .cse0 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= (_ bv1 32) (select (select (store (store (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 v_prenex_20))))) (or .cse0 (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))) (or (and (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (_ bv1 32) (select (select (store .cse16 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse16 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_114 v_prenex_20)))) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (_ bv1 32) (select (select (store (store (store .cse17 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store (store .cse17 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_114 v_prenex_20)))) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012))))) .cse7) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse19 (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (select (select (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= (_ bv1 32) (select (select (store .cse19 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse19 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 v_prenex_20))))) .cse7) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_arrayElimCell_121 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) .cse7) (or (and (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)))))) (= v_arrayElimCell_114 v_prenex_20))) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (_ bv1 32) (select (select (store .cse21 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse21 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))) (= v_arrayElimCell_114 v_prenex_20))) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012))))) .cse7) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) .cse7) (or .cse0 (and .cse8 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse22 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse22 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|))))))) (or .cse0 (and .cse8 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (= v_arrayElimCell_121 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32))) (or (forall ((v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse23 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse23 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|))))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse24 (store .cse25 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24))) (or (= (select (select (store .cse24 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse25 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store .cse24 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))))) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= v_arrayElimCell_114 v_prenex_20))))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse26 (store .cse27 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24))) (or (= (select (select (store .cse26 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse27 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store .cse26 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))))) (= v_arrayElimCell_114 v_prenex_20))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (or .cse0 (and .cse4 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse28 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store (store .cse28 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse29 (store .cse30 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24))) (or (= (select (select (store .cse29 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse30 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store .cse29 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))))) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)))))) (or .cse0 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24))) (or (= (select (select (store .cse31 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= (_ bv1 32) (select (select (store (store .cse31 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (or .cse0 (and .cse8 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= v_arrayElimCell_121 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse32 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse32 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= v_arrayElimCell_121 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse33 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse33 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))))) (or .cse0 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse34 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= (_ bv1 32) (select (select (store (store (store (store .cse34 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 v_prenex_20))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= v_arrayElimCell_121 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse35 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse35 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)))) (or .cse0 (and .cse4 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse36 (store .cse37 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24))) (or (= (select (select (store .cse36 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (_ bv1 32) (select (select (store (store (store .cse37 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse36 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse38 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= (_ bv1 32) (select (select (store (store (store (store .cse38 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))))) (or (and (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (_ bv1 32) (select (select (store (store (store .cse39 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store (store .cse39 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_114 v_prenex_20)))) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse40 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (_ bv1 32) (select (select (store .cse40 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse40 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_114 v_prenex_20))))))))) .cse7) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse41 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse41 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))))) (or .cse0 (and .cse4 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse42 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= (_ bv1 32) (select (select (store (store (store (store .cse42 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_114 v_prenex_20)))))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse43 (store .cse44 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24))) (or (= (select (select (store .cse43 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (_ bv1 32) (select (select (store (store (store .cse44 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse43 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= v_arrayElimCell_114 v_prenex_20))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012))))))) is different from true [2024-11-13 13:22:29,468 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base|)))) (.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (= (_ bv1 32) (select (select (store (store .cse1 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store .cse1 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (_ bv1 32) (select (select (store (store .cse3 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store .cse3 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= (_ bv1 32) (select (select (store (store .cse4 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= (_ bv1 32) (select (select (store (store (store (store .cse4 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 v_prenex_20)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|))) (or .cse5 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (select (select (store (store .cse6 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store .cse6 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 v_prenex_20))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse7 (store .cse8 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store .cse7 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))) (= (_ bv1 32) (select (select (store .cse7 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse8 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))))) (= v_arrayElimCell_114 v_prenex_20))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (_ bv1 32) (select (select (store (store .cse9 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store (store (store .cse9 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))))))))))) (or .cse5 (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (select (select (store (store .cse10 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= (_ bv1 32) (select (select (store .cse10 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 v_prenex_20)))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 v_prenex_20))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (_ bv1 32) (select (select (store (store .cse11 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store .cse11 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|))) (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (= (_ bv1 32) (select (select (store (store .cse12 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store .cse12 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (_ bv1 32) (select (select (store (store .cse13 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store (store (store .cse13 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))) (= v_arrayElimCell_114 v_prenex_20))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20))) (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|))) (or .cse5 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (select (select (store (store .cse14 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store .cse14 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 v_prenex_20))))) (or .cse5 (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse15 (store .cse16 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (= (_ bv1 32) (select (select (store (store .cse15 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store (store .cse16 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store .cse15 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 v_prenex_20))))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20))))))) (or .cse5 (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse17 (store .cse18 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (= (_ bv1 32) (select (select (store (store .cse17 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store (store .cse18 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= (_ bv1 32) (select (select (store .cse17 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= v_arrayElimCell_114 v_prenex_20))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (= (_ bv1 32) (select (select (store (store .cse19 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= (_ bv1 32) (select (select (store .cse19 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|))) (or .cse5 (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 v_prenex_20))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (select (select (store (store .cse20 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= (_ bv1 32) (select (select (store .cse20 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 v_prenex_20)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= (_ bv1 32) (select (select (store (store .cse21 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= (_ bv1 32) (select (select (store (store (store (store .cse21 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse22 (store .cse23 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store .cse22 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))) (= (_ bv1 32) (select (select (store .cse22 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse23 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))))) (= v_arrayElimCell_114 v_prenex_20))))) (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse24 (store .cse25 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store .cse24 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))) (= (_ bv1 32) (select (select (store .cse24 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse25 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20))))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= (_ bv1 32) (select (select (store (store .cse26 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= (_ bv1 32) (select (select (store (store (store (store .cse26 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 v_prenex_20)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (forall ((v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (_ bv1 32) (select (select (store (store .cse27 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store (store .cse27 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|))) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (= (_ bv1 32) (select (select (store (store .cse28 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store .cse28 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (= (_ bv1 32) (select (select (store (store .cse29 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store .cse29 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= (_ bv1 32) (select (select (store (store .cse30 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= (_ bv1 32) (select (select (store (store (store (store .cse30 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 v_prenex_20)))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20))) (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse31 (store .cse32 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (= (_ bv1 32) (select (select (store (store .cse31 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store (store .cse32 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= (_ bv1 32) (select (select (store .cse31 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (forall ((v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (_ bv1 32) (select (select (store (store .cse33 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store (store .cse33 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|))) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|))))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (_ bv1 32) (select (select (store (store .cse34 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store .cse34 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))))))))) is different from true [2024-11-13 13:22:48,994 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|)))) (.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|))))))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (= (_ bv1 32) (select (select (store (store (store (store .cse2 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (select (select (store (store .cse2 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (= v_arrayElimCell_114 v_prenex_20)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~list~0#1.base|))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (= (_ bv1 32) (select (select (store (store .cse3 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (= (select (select (store .cse3 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (= (_ bv1 32) (select (select (store (store .cse4 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~list~0#1.base|) (= (select (select (store .cse4 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))))))) (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012))) (or (= (_ bv1 32) (select (select (store (store (store (store .cse5 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (select (select (store (store .cse5 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))))) (= v_arrayElimCell_114 v_prenex_20))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store .cse6 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store .cse6 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012))) (or (= (_ bv1 32) (select (select (store (store (store (store .cse7 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (select (select (store (store .cse7 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))))))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|))))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store .cse8 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store .cse8 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (forall ((v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|))))))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) .cse9) (or (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~list~0#1.base|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (= v_arrayElimCell_114 v_prenex_20))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (_ bv1 32) (select (select (store (store .cse10 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (_ bv1 32) (select (select (store .cse10 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~list~0#1.base|) (= v_arrayElimCell_114 v_prenex_20))))) .cse9) (or .cse9 (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (_ bv1 32) (select (select (store (store .cse11 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (_ bv1 32) (select (select (store .cse11 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (= v_arrayElimCell_114 v_prenex_20)))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (= v_arrayElimCell_114 v_prenex_20))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~list~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~list~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store .cse12 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store .cse12 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))))))) (or .cse9 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (_ bv1 32) (select (select (store (store .cse13 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (_ bv1 32) (select (select (store .cse13 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= v_arrayElimCell_114 v_prenex_20))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~list~0#1.base|) (= (_ bv1 32) (select (select (store (store (store (store .cse14 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (select (select (store (store .cse14 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (= v_arrayElimCell_114 v_prenex_20)))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012))) (let ((.cse16 (store .cse15 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (= (_ bv1 32) (select (select (store (store (store .cse15 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (_ bv1 32) (select (select (store (store .cse16 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~list~0#1.base|) (= (select (select (store .cse16 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (= v_arrayElimCell_114 v_prenex_20))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~list~0#1.base|) (= (_ bv1 32) (select (select (store (store (store (store .cse17 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (select (select (store (store .cse17 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (= v_arrayElimCell_114 v_prenex_20)))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012))) (let ((.cse18 (store .cse19 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store .cse18 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= (select (select (store .cse18 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse19 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))))) (= v_arrayElimCell_114 v_prenex_20))))))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~list~0#1.base|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) .cse9) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012))) (let ((.cse21 (store .cse20 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (= (_ bv1 32) (select (select (store (store (store .cse20 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (_ bv1 32) (select (select (store (store .cse21 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (select (select (store .cse21 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (= v_arrayElimCell_114 v_prenex_20))))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (forall ((v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012))) (let ((.cse22 (store .cse23 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store .cse22 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= (select (select (store .cse22 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse23 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))))) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~list~0#1.base|) (= v_arrayElimCell_114 v_prenex_20))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~list~0#1.base|) (= (_ bv1 32) (select (select (store (store (store (store .cse24 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (select (select (store (store .cse24 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))))))) (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|))) (or .cse9 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (_ bv1 32) (select (select (store (store .cse25 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (_ bv1 32) (select (select (store .cse25 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~list~0#1.base|) (= v_arrayElimCell_114 v_prenex_20))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (= (_ bv1 32) (select (select (store (store .cse26 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (select (select (store .cse26 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))))))))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store .cse27 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= (select (select (store .cse27 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))))))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|))))))))) is different from true [2024-11-13 13:22:49,421 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:49,422 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:49,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 13:22:49,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 13:22:49,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 13:22:49,541 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:49,541 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:49,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2024-11-13 13:22:49,679 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:49,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 1 [2024-11-13 13:22:49,734 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:49,735 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:49,736 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:49,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2024-11-13 13:22:49,846 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:49,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 1 [2024-11-13 13:22:49,885 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:49,886 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:49,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-13 13:22:49,984 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:50,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 1 [2024-11-13 13:22:50,029 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:50,029 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:50,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2024-11-13 13:22:50,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:22:50,196 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:50,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 1 [2024-11-13 13:22:50,233 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:50,234 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:50,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-13 13:22:50,328 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:50,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 1 [2024-11-13 13:22:50,380 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:50,381 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:50,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 68 [2024-11-13 13:22:50,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 13:22:50,541 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:50,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 1 [2024-11-13 13:22:50,586 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:50,587 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:50,588 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:50,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2024-11-13 13:22:50,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 13:22:50,700 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:50,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 1 [2024-11-13 13:22:50,751 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:50,755 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:50,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2024-11-13 13:22:50,850 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:50,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 1 [2024-11-13 13:22:50,894 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:50,895 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:50,895 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:50,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-13 13:22:50,960 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:50,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 1 [2024-11-13 13:22:51,001 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:51,001 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:51,002 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:51,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2024-11-13 13:22:51,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 13:22:51,121 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:51,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 1 [2024-11-13 13:22:51,159 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:51,159 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:51,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2024-11-13 13:22:51,253 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:51,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 1 [2024-11-13 13:22:51,304 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:51,305 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:51,306 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:51,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2024-11-13 13:22:51,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 13:22:51,422 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:51,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 1 [2024-11-13 13:22:51,460 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:51,485 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:51,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 79 [2024-11-13 13:22:51,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-13 13:22:51,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2024-11-13 13:22:51,698 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:51,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 1 [2024-11-13 13:22:51,738 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:51,738 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:51,739 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:51,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2024-11-13 13:22:51,836 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:51,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 1 [2024-11-13 13:22:51,874 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:51,875 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:51,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-13 13:22:51,970 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:51,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 1 [2024-11-13 13:22:52,009 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:52,009 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:52,010 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:52,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2024-11-13 13:22:52,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 13:22:52,130 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:52,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 1 [2024-11-13 13:22:52,170 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:52,171 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:52,171 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:52,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2024-11-13 13:22:52,266 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:52,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 1 [2024-11-13 13:22:52,305 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:52,305 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:52,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2024-11-13 13:22:52,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 13:22:52,424 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:52,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 1 [2024-11-13 13:22:52,475 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:52,476 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:52,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 68 [2024-11-13 13:22:52,596 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:52,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 1 [2024-11-13 13:22:57,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-13 13:22:57,111 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:22:57,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538375557] [2024-11-13 13:22:57,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538375557] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:22:57,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:22:57,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2024-11-13 13:22:57,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987472607] [2024-11-13 13:22:57,111 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:22:57,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-13 13:22:57,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:22:57,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-13 13:22:57,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=708, Unknown=41, NotChecked=434, Total=1332 [2024-11-13 13:22:57,114 INFO L87 Difference]: Start difference. First operand 192 states and 208 transitions. Second operand has 37 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 37 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:23:02,569 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse9 (not (= (_ bv0 1) .cse11))) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|))))))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (= (_ bv1 32) (select (select (store (store (store (store .cse2 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (select (select (store (store .cse2 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (= v_arrayElimCell_114 v_prenex_20)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~list~0#1.base|))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (= (_ bv1 32) (select (select (store (store .cse3 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (= (select (select (store .cse3 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (= (_ bv1 32) (select (select (store (store .cse4 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~list~0#1.base|) (= (select (select (store .cse4 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))))))) (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012))) (or (= (_ bv1 32) (select (select (store (store (store (store .cse5 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (select (select (store (store .cse5 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))))) (= v_arrayElimCell_114 v_prenex_20))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store .cse6 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store .cse6 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012))) (or (= (_ bv1 32) (select (select (store (store (store (store .cse7 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (select (select (store (store .cse7 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))))))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|))))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store .cse8 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store .cse8 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (forall ((v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|))))))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) .cse9) (or (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~list~0#1.base|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (= v_arrayElimCell_114 v_prenex_20))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (_ bv1 32) (select (select (store (store .cse10 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (_ bv1 32) (select (select (store .cse10 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~list~0#1.base|) (= v_arrayElimCell_114 v_prenex_20))))) .cse9) (= (_ bv0 1) (bvadd (_ bv1 1) .cse11)) (or .cse9 (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (_ bv1 32) (select (select (store (store .cse12 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (_ bv1 32) (select (select (store .cse12 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (= v_arrayElimCell_114 v_prenex_20)))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (= v_arrayElimCell_114 v_prenex_20))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~list~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~list~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store .cse13 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store .cse13 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))))))) (or .cse9 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (_ bv1 32) (select (select (store (store .cse14 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (_ bv1 32) (select (select (store .cse14 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= v_arrayElimCell_114 v_prenex_20))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~list~0#1.base|) (= (_ bv1 32) (select (select (store (store (store (store .cse15 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (select (select (store (store .cse15 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (= v_arrayElimCell_114 v_prenex_20)))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012))) (let ((.cse17 (store .cse16 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (= (_ bv1 32) (select (select (store (store (store .cse16 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (_ bv1 32) (select (select (store (store .cse17 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~list~0#1.base|) (= (select (select (store .cse17 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (= v_arrayElimCell_114 v_prenex_20))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~list~0#1.base|) (= (_ bv1 32) (select (select (store (store (store (store .cse18 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (select (select (store (store .cse18 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (= v_arrayElimCell_114 v_prenex_20)))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012))) (let ((.cse19 (store .cse20 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store .cse19 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= (select (select (store .cse19 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse20 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))))) (= v_arrayElimCell_114 v_prenex_20))))))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~list~0#1.base|) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) .cse9) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012))) (let ((.cse22 (store .cse21 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (= (_ bv1 32) (select (select (store (store (store .cse21 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (_ bv1 32) (select (select (store (store .cse22 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (select (select (store .cse22 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (= v_arrayElimCell_114 v_prenex_20))))))))))) (= (_ bv0 32) |c_ULTIMATE.start_main_~list~0#1.offset|) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (forall ((v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012))) (let ((.cse23 (store .cse24 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store .cse23 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= (select (select (store .cse23 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32)) (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse24 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))))) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~list~0#1.base|) (= v_arrayElimCell_114 v_prenex_20))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~list~0#1.base|) (= (_ bv1 32) (select (select (store (store (store (store .cse25 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (select (select (store (store .cse25 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))))))) (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|))) (or .cse9 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (_ bv1 32) (select (select (store (store .cse26 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (_ bv1 32) (select (select (store .cse26 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~list~0#1.base|) (= v_arrayElimCell_114 v_prenex_20))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (= (_ bv1 32) (select (select (store (store .cse27 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (select (select (store .cse27 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))))))))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store .cse28 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= (select (select (store .cse28 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (_ bv1 32))))))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_~list~0#1.base|))))))) (= (_ bv1 32) (select .cse0 (_ bv8 32)))))) is different from true [2024-11-13 13:23:06,634 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base|)))) (.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (= (_ bv1 32) (select (select (store (store .cse1 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store .cse1 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (_ bv1 32) (select (select (store (store .cse3 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store .cse3 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= (_ bv1 32) (select (select (store (store .cse4 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= (_ bv1 32) (select (select (store (store (store (store .cse4 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 v_prenex_20)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|))) (or .cse5 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (select (select (store (store .cse6 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store .cse6 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 v_prenex_20))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse7 (store .cse8 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store .cse7 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))) (= (_ bv1 32) (select (select (store .cse7 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse8 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))))) (= v_arrayElimCell_114 v_prenex_20))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (_ bv1 32) (select (select (store (store .cse9 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store (store (store .cse9 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))))))))))) (or .cse5 (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (select (select (store (store .cse10 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= (_ bv1 32) (select (select (store .cse10 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 v_prenex_20)))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 v_prenex_20))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (_ bv1 32) (select (select (store (store .cse11 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store .cse11 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|))) (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (= (_ bv1 32) (select (select (store (store .cse12 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store .cse12 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (_ bv1 32) (select (select (store (store .cse13 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store (store (store .cse13 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))) (= v_arrayElimCell_114 v_prenex_20))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20))) (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|))) (or .cse5 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (select (select (store (store .cse14 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store .cse14 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 v_prenex_20))))) (or .cse5 (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse15 (store .cse16 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (= (_ bv1 32) (select (select (store (store .cse15 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store (store .cse16 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store .cse15 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 v_prenex_20))))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|))) (or .cse5 (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse17 (store .cse18 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (= (_ bv1 32) (select (select (store (store .cse17 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store (store .cse18 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= (_ bv1 32) (select (select (store .cse17 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= v_arrayElimCell_114 v_prenex_20))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (= (_ bv1 32) (select (select (store (store .cse19 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= (_ bv1 32) (select (select (store .cse19 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|))) (= (_ bv0 32) |c_ULTIMATE.start_main_~list~0#1.offset|) (or .cse5 (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 v_prenex_20))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (select (select (store (store .cse20 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) (_ bv1 32)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= (_ bv1 32) (select (select (store .cse20 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 v_prenex_20)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= (_ bv1 32) (select (select (store (store .cse21 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= (_ bv1 32) (select (select (store (store (store (store .cse21 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse22 (store .cse23 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store .cse22 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))) (= (_ bv1 32) (select (select (store .cse22 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse23 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))))) (= v_arrayElimCell_114 v_prenex_20))))) (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse24 (store .cse25 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store .cse24 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))) (= (_ bv1 32) (select (select (store .cse24 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse25 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20))))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|))) (= |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv0 32)) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= (_ bv1 32) (select (select (store (store .cse26 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= (_ bv1 32) (select (select (store (store (store (store .cse26 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 v_prenex_20)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (forall ((v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (_ bv1 32) (select (select (store (store .cse27 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store (store .cse27 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|))) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (= (_ bv1 32) (select (select (store (store .cse28 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store .cse28 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (= (_ bv1 32) (select (select (store (store .cse29 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store .cse29 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= (_ bv1 32) (select (select (store (store .cse30 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= (_ bv1 32) (select (select (store (store (store (store .cse30 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 v_prenex_20)))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20))) (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)))))) (= (_ bv1 32) (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base|) (_ bv8 32))) (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_20) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse31 (store .cse32 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_24))) (or (= (_ bv1 32) (select (select (store (store .cse31 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store (store .cse32 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_114) (= (_ bv1 32) (select (select (store .cse31 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_arrayElimCell_121) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (forall ((v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (_ bv1 32) (select (select (store (store .cse33 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store (store .cse33 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|))) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|))))) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |c_ULTIMATE.start_main_~end~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (_ bv1 32) (select (select (store (store .cse34 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_24| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= (_ bv1 32) (select (select (store (store (store .cse34 |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))))))))) is different from true [2024-11-13 13:23:10,711 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse8 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))))) (.cse7 (not .cse0)) (.cse4 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse45 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24))) (or (= (select (select (store .cse45 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store .cse45 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))))) (and (or .cse0 (and (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))) (= v_arrayElimCell_114 v_prenex_20))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) .cse4)) (or (and (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (_ bv1 32) (select (select (store .cse5 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse5 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))) (= v_arrayElimCell_114 v_prenex_20))) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)))))) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 v_prenex_20))) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|)))))) .cse7) (or .cse0 (and .cse8 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (= v_arrayElimCell_121 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32))) (or (forall ((v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|))))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24))) (or (= (select (select (store .cse10 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse10 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_114 v_prenex_20))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (or .cse0 (and .cse8 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (= v_arrayElimCell_121 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)))))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse14 (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (select (select (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= (_ bv1 32) (select (select (store .cse14 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse14 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 v_prenex_20))))) .cse7) (or .cse0 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= (_ bv1 32) (select (select (store (store (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 v_prenex_20))))) (or .cse0 (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))) (or (and (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (_ bv1 32) (select (select (store .cse16 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse16 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_114 v_prenex_20)))) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (_ bv1 32) (select (select (store (store (store .cse17 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store (store .cse17 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_114 v_prenex_20)))) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012))))) .cse7) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse19 (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (select (select (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= (_ bv1 32) (select (select (store .cse19 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse19 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 v_prenex_20))))) .cse7) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_arrayElimCell_121 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) .cse7) (or (and (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)))))) (= v_arrayElimCell_114 v_prenex_20))) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (_ bv1 32) (select (select (store .cse21 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse21 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))) (= v_arrayElimCell_114 v_prenex_20))) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012))))) .cse7) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) .cse7) (or .cse0 (and .cse8 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse22 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse22 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|))))))) (or .cse0 (and .cse8 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_arrayElimCell_121 (_ BitVec 32))) (or (= v_arrayElimCell_121 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32))) (or (forall ((v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse23 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse23 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|))))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse24 (store .cse25 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24))) (or (= (select (select (store .cse24 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse25 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store .cse24 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))))) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= v_arrayElimCell_114 v_prenex_20))))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse26 (store .cse27 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24))) (or (= (select (select (store .cse26 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse27 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store .cse26 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))))) (= v_arrayElimCell_114 v_prenex_20))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (or .cse0 (and .cse4 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse28 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store (store .cse28 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_arrayElimCell_114 (_ BitVec 32))) (or (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse29 (store .cse30 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24))) (or (= (select (select (store .cse29 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (forall ((v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse30 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store .cse29 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))))) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)))))) (or .cse0 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24))) (or (= (select (select (store .cse31 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= (_ bv1 32) (select (select (store (store .cse31 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (or .cse0 (and .cse8 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= v_arrayElimCell_121 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse32 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse32 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= v_arrayElimCell_121 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse33 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse33 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_121 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))))) (or .cse0 (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_20 (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse34 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= (_ bv1 32) (select (select (store (store (store (store .cse34 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 v_prenex_20))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= v_arrayElimCell_121 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse35 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse35 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)))) (= (_ bv0 32) |c_ULTIMATE.start_main_~list~0#1.offset|) (or .cse0 (and .cse4 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse36 (store .cse37 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24))) (or (= (select (select (store .cse36 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (_ bv1 32) (select (select (store (store (store .cse37 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse36 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse38 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= (_ bv1 32) (select (select (store (store (store (store .cse38 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))))) (= |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv0 32)) (or (and (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (_ bv1 32) (select (select (store (store (store .cse39 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store (store .cse39 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_114 v_prenex_20)))) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))))) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse40 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24))) (or (= (_ bv1 32) (select (select (store .cse40 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse40 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_114 v_prenex_20))))))))) .cse7) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_121 (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse41 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store .cse41 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_121 v_ArrVal_1019) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1023) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= v_arrayElimCell_121 |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_15| |c_ULTIMATE.start_main_#t~malloc3#1.base|)))))) (= (_ bv1 32) (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base|) (_ bv8 32))) (or .cse0 (and .cse4 (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (or (= (select (select (store (store .cse42 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= (_ bv1 32) (select (select (store (store (store (store .cse42 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_114 v_prenex_20)))))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012)))))) (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_prenex_20 (_ BitVec 32))) (or (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_prenex_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1012))) (let ((.cse43 (store .cse44 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_24))) (or (= (select (select (store .cse43 v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) (_ bv1 32)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (_ bv1 32) (select (select (store (store (store .cse44 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_23) v_arrayElimCell_114 v_prenex_24) v_prenex_20 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse43 v_prenex_20 v_ArrVal_1020) v_arrayElimCell_112 v_prenex_21) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (= v_arrayElimCell_114 |c_ULTIMATE.start_main_~end~0#1.base|) (= v_arrayElimCell_114 v_prenex_20))))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_20) (= v_prenex_20 |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1012 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1012))))))) is different from true [2024-11-13 13:23:32,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:23:32,420 INFO L93 Difference]: Finished difference Result 264 states and 288 transitions. [2024-11-13 13:23:32,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 13:23:32,421 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 37 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-13 13:23:32,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:23:32,422 INFO L225 Difference]: With dead ends: 264 [2024-11-13 13:23:32,422 INFO L226 Difference]: Without dead ends: 264 [2024-11-13 13:23:32,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=244, Invalid=1080, Unknown=48, NotChecked=790, Total=2162 [2024-11-13 13:23:32,424 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 387 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 2614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1479 IncrementalHoareTripleChecker+Unchecked, 19.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:23:32,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 664 Invalid, 2614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1081 Invalid, 0 Unknown, 1479 Unchecked, 19.1s Time] [2024-11-13 13:23:32,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-13 13:23:32,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 203. [2024-11-13 13:23:32,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 180 states have (on average 1.2) internal successors, (216), 201 states have internal predecessors, (216), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:23:32,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 219 transitions. [2024-11-13 13:23:32,430 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 219 transitions. Word has length 47 [2024-11-13 13:23:32,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:23:32,431 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 219 transitions. [2024-11-13 13:23:32,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 37 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:23:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 219 transitions. [2024-11-13 13:23:32,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-13 13:23:32,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:23:32,432 INFO L215 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:23:32,451 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-11-13 13:23:32,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:23:32,633 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:23:32,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:23:32,633 INFO L85 PathProgramCache]: Analyzing trace with hash -245607633, now seen corresponding path program 2 times [2024-11-13 13:23:32,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:23:32,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1472256267] [2024-11-13 13:23:32,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:23:32,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:23:32,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:23:32,635 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:23:32,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-13 13:23:32,935 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:23:32,935 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:23:32,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-13 13:23:32,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:23:33,505 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 13:23:33,506 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 13 treesize of output 13 [2024-11-13 13:23:33,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:23:34,584 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:23:34,585 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-13 13:23:35,598 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 13:23:35,598 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-13 13:23:35,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-13 13:23:35,869 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:23:35,869 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 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-13 13:23:36,505 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 13:23:36,505 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-13 13:23:36,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-13 13:23:36,777 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:23:36,777 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 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-13 13:23:42,212 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:23:42,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:24:05,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:24:05,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 245 [2024-11-13 13:24:05,262 INFO L224 Elim1Store]: Index analysis took 145 ms [2024-11-13 13:24:06,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:24:06,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 180 treesize of output 218 [2024-11-13 13:24:40,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:24:40,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 94 treesize of output 90 [2024-11-13 13:24:41,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:24:41,189 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 42 treesize of output 46 [2024-11-13 13:24:45,488 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|) (forall ((v_ArrVal_1072 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1072) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_~list~0#1.base|)) is different from false [2024-11-13 13:24:45,689 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|) (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_1072 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1072) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) |c_ULTIMATE.start_main_~list~0#1.base|)))) is different from false [2024-11-13 13:24:46,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:24:46,004 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-11-13 13:24:46,054 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 33 treesize of output 25 [2024-11-13 13:24:46,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-13 13:24:48,233 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:24:48,233 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:24:48,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472256267] [2024-11-13 13:24:48,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472256267] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:24:48,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:24:48,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 27 [2024-11-13 13:24:48,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982605380] [2024-11-13 13:24:48,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:24:48,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-13 13:24:48,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:24:48,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-13 13:24:48,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=538, Unknown=2, NotChecked=94, Total=702 [2024-11-13 13:24:48,235 INFO L87 Difference]: Start difference. First operand 203 states and 219 transitions. Second operand has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 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-11-13 13:24:52,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:24:58,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:25:11,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:25:22,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:25:31,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:25:38,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:25:52,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:26:03,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:26:03,006 INFO L93 Difference]: Finished difference Result 240 states and 262 transitions. [2024-11-13 13:26:03,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 13:26:03,007 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 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) Word has length 47 [2024-11-13 13:26:03,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:26:03,008 INFO L225 Difference]: With dead ends: 240 [2024-11-13 13:26:03,009 INFO L226 Difference]: Without dead ends: 240 [2024-11-13 13:26:03,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 36.7s TimeCoverageRelationStatistics Valid=200, Invalid=1366, Unknown=2, NotChecked=154, Total=1722 [2024-11-13 13:26:03,009 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 400 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 47 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 395 IncrementalHoareTripleChecker+Unchecked, 62.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:26:03,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 766 Invalid, 1725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1276 Invalid, 7 Unknown, 395 Unchecked, 62.8s Time] [2024-11-13 13:26:03,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-13 13:26:03,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 205. [2024-11-13 13:26:03,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 182 states have (on average 1.1978021978021978) internal successors, (218), 203 states have internal predecessors, (218), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:26:03,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 221 transitions. [2024-11-13 13:26:03,016 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 221 transitions. Word has length 47 [2024-11-13 13:26:03,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:26:03,016 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 221 transitions. [2024-11-13 13:26:03,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 27 states have internal predecessors, (85), 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-11-13 13:26:03,017 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 221 transitions. [2024-11-13 13:26:03,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-13 13:26:03,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:26:03,018 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:26:03,043 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-11-13 13:26:03,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:26:03,218 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-13 13:26:03,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:26:03,219 INFO L85 PathProgramCache]: Analyzing trace with hash -326463623, now seen corresponding path program 1 times [2024-11-13 13:26:03,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:26:03,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [336643616] [2024-11-13 13:26:03,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:26:03,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:26:03,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:26:03,221 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:26:03,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efd97c62-2d90-4167-9ae8-873c7af28432/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-13 13:26:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:26:03,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 13:26:03,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:26:03,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-13 13:26:04,565 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 13:26:04,565 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 13 treesize of output 13 [2024-11-13 13:26:05,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:26:05,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:26:06,532 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:26:06,533 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-13 13:26:06,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-11-13 13:26:08,259 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:26:08,260 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 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-13 13:26:08,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:26:08,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:26:09,076 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-13 13:26:09,076 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 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-13 13:26:09,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:26:09,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 13:26:18,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:26:18,505 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:26:54,496 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1129 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1129))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1133 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1128))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse0 (store .cse3 .cse2 v_ArrVal_1133))) (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_1132) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) (not (= (_ bv0 32) (select v_ArrVal_1133 .cse4))))) (not (= (_ bv0 32) (select v_ArrVal_1132 .cse4))))))) (forall ((v_ArrVal_1132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1129 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1129))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1133 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1128))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (select (let ((.cse5 (store .cse6 .cse7 v_ArrVal_1132))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store .cse8 .cse7 v_ArrVal_1133) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (not (= (_ bv0 32) (select v_ArrVal_1133 .cse9))))) (not (= (_ bv0 32) (select v_ArrVal_1132 .cse9)))))))) is different from false [2024-11-13 13:26:55,000 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_1132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1129 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1129))) (let ((.cse5 (select (select .cse3 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1133 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_1128))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse0 (store .cse3 .cse2 v_ArrVal_1133))) (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_1132) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) (not (= (select v_ArrVal_1133 .cse5) (_ bv0 32))))) (not (= (_ bv0 32) (select v_ArrVal_1132 .cse5))))))) (forall ((v_ArrVal_1132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1129 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1129))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= (_ bv0 32) (select v_ArrVal_1132 .cse6))) (forall ((v_ArrVal_1133 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_1128))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (select (let ((.cse7 (store .cse8 .cse9 v_ArrVal_1132))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store .cse10 .cse9 v_ArrVal_1133) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (not (= (select v_ArrVal_1133 .cse6) (_ bv0 32))))))))))) is different from false [2024-11-13 13:26:55,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:26:55,562 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 129 [2024-11-13 13:26:55,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:26:55,681 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 63