./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1 --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 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 14:02:55,467 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 14:02:55,520 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-12-02 14:02:55,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 14:02:55,525 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 14:02:55,546 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 14:02:55,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 14:02:55,547 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 14:02:55,547 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 14:02:55,547 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 14:02:55,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 14:02:55,547 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 14:02:55,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 14:02:55,548 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 14:02:55,548 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 14:02:55,548 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 14:02:55,548 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 14:02:55,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 14:02:55,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 14:02:55,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 14:02:55,548 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-02 14:02:55,548 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-02 14:02:55,548 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-02 14:02:55,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 14:02:55,549 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 14:02:55,549 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 14:02:55,549 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 14:02:55,549 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 14:02:55,549 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 14:02:55,549 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 14:02:55,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:02:55,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:02:55,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:02:55,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:02:55,549 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 14:02:55,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 14:02:55,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 14:02:55,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 14:02:55,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:02:55,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 14:02:55,550 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 14:02:55,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 14:02:55,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 14:02:55,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 14:02:55,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 14:02:55,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 14:02:55,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 14:02:55,550 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_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1 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 -> 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 [2024-12-02 14:02:55,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 14:02:55,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 14:02:55,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 14:02:55,788 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 14:02:55,789 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 14:02:55,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2024-12-02 14:02:58,477 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/data/a802d32be/b5f7636c343f4adfa9b957b38b76b576/FLAG3ef52fa09 [2024-12-02 14:02:58,722 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 14:02:58,723 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2024-12-02 14:02:58,734 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/data/a802d32be/b5f7636c343f4adfa9b957b38b76b576/FLAG3ef52fa09 [2024-12-02 14:02:59,041 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/data/a802d32be/b5f7636c343f4adfa9b957b38b76b576 [2024-12-02 14:02:59,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 14:02:59,044 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 14:02:59,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 14:02:59,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 14:02:59,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 14:02:59,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:02:59" (1/1) ... [2024-12-02 14:02:59,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e241b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:02:59, skipping insertion in model container [2024-12-02 14:02:59,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:02:59" (1/1) ... [2024-12-02 14:02:59,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 14:02:59,255 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 14:02:59,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:02:59,275 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 14:02:59,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 14:02:59,330 INFO L204 MainTranslator]: Completed translation [2024-12-02 14:02:59,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:02:59 WrapperNode [2024-12-02 14:02:59,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 14:02:59,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 14:02:59,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 14:02:59,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 14:02:59,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:02:59" (1/1) ... [2024-12-02 14:02:59,347 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:02:59" (1/1) ... [2024-12-02 14:02:59,365 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2024-12-02 14:02:59,365 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 14:02:59,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 14:02:59,366 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 14:02:59,366 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 14:02:59,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:02:59" (1/1) ... [2024-12-02 14:02:59,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:02:59" (1/1) ... [2024-12-02 14:02:59,375 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:02:59" (1/1) ... [2024-12-02 14:02:59,391 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 8, 11]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 8 writes are split as follows [0, 2, 6]. [2024-12-02 14:02:59,391 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:02:59" (1/1) ... [2024-12-02 14:02:59,391 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:02:59" (1/1) ... [2024-12-02 14:02:59,399 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:02:59" (1/1) ... [2024-12-02 14:02:59,400 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:02:59" (1/1) ... [2024-12-02 14:02:59,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:02:59" (1/1) ... [2024-12-02 14:02:59,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:02:59" (1/1) ... [2024-12-02 14:02:59,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:02:59" (1/1) ... [2024-12-02 14:02:59,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 14:02:59,409 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 14:02:59,409 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 14:02:59,409 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 14:02:59,410 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:02:59" (1/1) ... [2024-12-02 14:02:59,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 14:02:59,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:02:59,437 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 14:02:59,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 14:02:59,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-12-02 14:02:59,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-12-02 14:02:59,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-12-02 14:02:59,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-02 14:02:59,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 14:02:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-02 14:02:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-12-02 14:02:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-12-02 14:02:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-12-02 14:02:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-12-02 14:02:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-12-02 14:02:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-12-02 14:02:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-02 14:02:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-12-02 14:02:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-12-02 14:02:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-12-02 14:02:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 14:02:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-12-02 14:02:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-12-02 14:02:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 14:02:59,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 14:02:59,545 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 14:02:59,546 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 14:02:59,812 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-12-02 14:02:59,812 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 14:02:59,822 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 14:02:59,823 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-12-02 14:02:59,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:02:59 BoogieIcfgContainer [2024-12-02 14:02:59,823 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 14:02:59,825 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 14:02:59,825 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 14:02:59,830 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 14:02:59,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:02:59" (1/3) ... [2024-12-02 14:02:59,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17893eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:02:59, skipping insertion in model container [2024-12-02 14:02:59,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:02:59" (2/3) ... [2024-12-02 14:02:59,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17893eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:02:59, skipping insertion in model container [2024-12-02 14:02:59,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:02:59" (3/3) ... [2024-12-02 14:02:59,832 INFO L128 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2024-12-02 14:02:59,846 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 14:02:59,847 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG optional_data_creation_test04-1.i that has 1 procedures, 101 locations, 1 initial locations, 3 loop locations, and 46 error locations. [2024-12-02 14:02:59,884 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 14:02:59,894 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;@bf36397, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 14:02:59,894 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-12-02 14:02:59,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 54 states have (on average 2.037037037037037) internal successors, (110), 100 states have internal predecessors, (110), 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-12-02 14:02:59,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-02 14:02:59,902 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:02:59,902 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-12-02 14:02:59,903 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:02:59,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:02:59,906 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2024-12-02 14:02:59,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:02:59,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211924557] [2024-12-02 14:02:59,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:02:59,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:02:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:00,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:00,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:00,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211924557] [2024-12-02 14:03:00,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211924557] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:00,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:00,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:03:00,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923217990] [2024-12-02 14:03:00,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:00,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:03:00,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:00,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:03:00,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:03:00,180 INFO L87 Difference]: Start difference. First operand has 101 states, 54 states have (on average 2.037037037037037) internal successors, (110), 100 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:03:00,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:00,334 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2024-12-02 14:03:00,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 14:03:00,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-12-02 14:03:00,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:00,341 INFO L225 Difference]: With dead ends: 104 [2024-12-02 14:03:00,341 INFO L226 Difference]: Without dead ends: 102 [2024-12-02 14:03:00,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-02 14:03:00,344 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 117 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:00,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 94 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:03:00,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-12-02 14:03:00,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2024-12-02 14:03:00,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 95 states have internal predecessors, (103), 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-12-02 14:03:00,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2024-12-02 14:03:00,372 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 4 [2024-12-02 14:03:00,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:00,373 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2024-12-02 14:03:00,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:03:00,373 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2024-12-02 14:03:00,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-02 14:03:00,373 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:00,373 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-12-02 14:03:00,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 14:03:00,374 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:00,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:00,374 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2024-12-02 14:03:00,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:00,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949517373] [2024-12-02 14:03:00,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:00,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:00,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:00,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:00,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949517373] [2024-12-02 14:03:00,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949517373] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:00,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:00,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:03:00,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553632348] [2024-12-02 14:03:00,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:00,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:03:00,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:00,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:03:00,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:03:00,526 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:03:00,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:00,704 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2024-12-02 14:03:00,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 14:03:00,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-12-02 14:03:00,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:00,706 INFO L225 Difference]: With dead ends: 135 [2024-12-02 14:03:00,706 INFO L226 Difference]: Without dead ends: 135 [2024-12-02 14:03:00,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-02 14:03:00,707 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 114 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:00,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 98 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 14:03:00,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-12-02 14:03:00,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 105. [2024-12-02 14:03:00,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 66 states have (on average 1.7878787878787878) internal successors, (118), 104 states have internal predecessors, (118), 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-12-02 14:03:00,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2024-12-02 14:03:00,715 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 4 [2024-12-02 14:03:00,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:00,715 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2024-12-02 14:03:00,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:03:00,715 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2024-12-02 14:03:00,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-02 14:03:00,715 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:00,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-12-02 14:03:00,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 14:03:00,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:00,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:00,716 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2024-12-02 14:03:00,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:00,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890498595] [2024-12-02 14:03:00,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:00,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:00,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:00,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890498595] [2024-12-02 14:03:00,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890498595] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:00,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:00,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 14:03:00,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881913569] [2024-12-02 14:03:00,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:00,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:03:00,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:00,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:03:00,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:03:00,755 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:03:00,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:00,830 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2024-12-02 14:03:00,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:03:00,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-12-02 14:03:00,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:00,832 INFO L225 Difference]: With dead ends: 103 [2024-12-02 14:03:00,832 INFO L226 Difference]: Without dead ends: 103 [2024-12-02 14:03:00,832 INFO L434 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-12-02 14:03:00,833 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 30 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:00,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 111 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:03:00,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-12-02 14:03:00,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-12-02 14:03:00,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.7575757575757576) internal successors, (116), 102 states have internal predecessors, (116), 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-12-02 14:03:00,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2024-12-02 14:03:00,840 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 5 [2024-12-02 14:03:00,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:00,840 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2024-12-02 14:03:00,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:03:00,840 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2024-12-02 14:03:00,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-02 14:03:00,841 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:00,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-12-02 14:03:00,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 14:03:00,841 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:00,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:00,842 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2024-12-02 14:03:00,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:00,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502651285] [2024-12-02 14:03:00,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:00,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:00,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:00,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:00,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502651285] [2024-12-02 14:03:00,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502651285] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:00,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:00,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 14:03:00,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298631844] [2024-12-02 14:03:00,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:00,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:03:00,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:00,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:03:00,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:03:00,897 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:03:00,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:00,958 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2024-12-02 14:03:00,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:03:00,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-12-02 14:03:00,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:00,960 INFO L225 Difference]: With dead ends: 101 [2024-12-02 14:03:00,960 INFO L226 Difference]: Without dead ends: 101 [2024-12-02 14:03:00,960 INFO L434 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-12-02 14:03:00,961 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 30 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:00,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 116 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:03:00,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-12-02 14:03:00,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-12-02 14:03:00,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 66 states have (on average 1.7272727272727273) internal successors, (114), 100 states have internal predecessors, (114), 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-12-02 14:03:00,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2024-12-02 14:03:00,967 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 5 [2024-12-02 14:03:00,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:00,967 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2024-12-02 14:03:00,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:03:00,967 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2024-12-02 14:03:00,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-02 14:03:00,968 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:00,968 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:03:00,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 14:03:00,968 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:00,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:00,968 INFO L85 PathProgramCache]: Analyzing trace with hash 234240045, now seen corresponding path program 1 times [2024-12-02 14:03:00,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:00,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212315137] [2024-12-02 14:03:00,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:00,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:01,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:01,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:01,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212315137] [2024-12-02 14:03:01,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212315137] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:01,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:01,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 14:03:01,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186395274] [2024-12-02 14:03:01,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:01,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:03:01,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:01,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:03:01,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:03:01,030 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-12-02 14:03:01,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:01,092 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2024-12-02 14:03:01,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:03:01,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-12-02 14:03:01,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:01,093 INFO L225 Difference]: With dead ends: 97 [2024-12-02 14:03:01,093 INFO L226 Difference]: Without dead ends: 97 [2024-12-02 14:03:01,093 INFO L434 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-12-02 14:03:01,094 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 14 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:01,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 114 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:03:01,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-12-02 14:03:01,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-12-02 14:03:01,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 66 states have (on average 1.6666666666666667) internal successors, (110), 96 states have internal predecessors, (110), 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-12-02 14:03:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2024-12-02 14:03:01,099 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 9 [2024-12-02 14:03:01,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:01,099 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2024-12-02 14:03:01,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-12-02 14:03:01,099 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2024-12-02 14:03:01,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-02 14:03:01,099 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:01,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:03:01,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 14:03:01,100 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:01,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:01,100 INFO L85 PathProgramCache]: Analyzing trace with hash 234240046, now seen corresponding path program 1 times [2024-12-02 14:03:01,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:01,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995044199] [2024-12-02 14:03:01,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:01,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:01,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:01,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995044199] [2024-12-02 14:03:01,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995044199] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:01,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:01,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 14:03:01,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305018249] [2024-12-02 14:03:01,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:01,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 14:03:01,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:01,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 14:03:01,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 14:03:01,169 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-12-02 14:03:01,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:01,229 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2024-12-02 14:03:01,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 14:03:01,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-12-02 14:03:01,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:01,230 INFO L225 Difference]: With dead ends: 93 [2024-12-02 14:03:01,230 INFO L226 Difference]: Without dead ends: 93 [2024-12-02 14:03:01,230 INFO L434 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-12-02 14:03:01,230 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 14 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:01,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 119 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:03:01,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-12-02 14:03:01,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-12-02 14:03:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.606060606060606) internal successors, (106), 92 states have internal predecessors, (106), 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-12-02 14:03:01,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2024-12-02 14:03:01,235 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 9 [2024-12-02 14:03:01,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:01,235 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2024-12-02 14:03:01,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-12-02 14:03:01,236 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2024-12-02 14:03:01,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-02 14:03:01,236 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:01,236 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:03:01,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 14:03:01,236 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:01,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:01,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1431688691, now seen corresponding path program 1 times [2024-12-02 14:03:01,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:01,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021858353] [2024-12-02 14:03:01,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:01,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:01,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:01,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:01,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021858353] [2024-12-02 14:03:01,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021858353] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:01,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:01,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:03:01,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727268768] [2024-12-02 14:03:01,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:01,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:03:01,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:01,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:03:01,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:03:01,342 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-12-02 14:03:01,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:01,453 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2024-12-02 14:03:01,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:03:01,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2024-12-02 14:03:01,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:01,454 INFO L225 Difference]: With dead ends: 102 [2024-12-02 14:03:01,454 INFO L226 Difference]: Without dead ends: 102 [2024-12-02 14:03:01,454 INFO L434 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-12-02 14:03:01,455 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 6 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:01,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 217 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:03:01,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-12-02 14:03:01,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2024-12-02 14:03:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.6) internal successors, (112), 96 states have internal predecessors, (112), 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-12-02 14:03:01,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2024-12-02 14:03:01,459 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 14 [2024-12-02 14:03:01,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:01,459 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2024-12-02 14:03:01,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-12-02 14:03:01,459 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2024-12-02 14:03:01,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-02 14:03:01,459 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:01,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:03:01,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 14:03:01,460 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:01,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:01,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1431688692, now seen corresponding path program 1 times [2024-12-02 14:03:01,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:01,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574388735] [2024-12-02 14:03:01,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:01,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:01,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:01,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:01,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574388735] [2024-12-02 14:03:01,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574388735] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:01,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:01,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:03:01,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94797926] [2024-12-02 14:03:01,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:01,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 14:03:01,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:01,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 14:03:01,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 14:03:01,694 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-12-02 14:03:01,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:01,815 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2024-12-02 14:03:01,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 14:03:01,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2024-12-02 14:03:01,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:01,816 INFO L225 Difference]: With dead ends: 97 [2024-12-02 14:03:01,816 INFO L226 Difference]: Without dead ends: 97 [2024-12-02 14:03:01,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:03:01,817 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 4 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:01,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 225 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:03:01,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-12-02 14:03:01,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-12-02 14:03:01,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 96 states have internal predecessors, (110), 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-12-02 14:03:01,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2024-12-02 14:03:01,821 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 14 [2024-12-02 14:03:01,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:01,821 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2024-12-02 14:03:01,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-12-02 14:03:01,821 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2024-12-02 14:03:01,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-02 14:03:01,821 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:01,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:03:01,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 14:03:01,822 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:01,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:01,822 INFO L85 PathProgramCache]: Analyzing trace with hash 578636057, now seen corresponding path program 1 times [2024-12-02 14:03:01,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:01,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755435399] [2024-12-02 14:03:01,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:01,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:01,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:01,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:01,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755435399] [2024-12-02 14:03:01,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755435399] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:01,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:01,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:03:01,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426649880] [2024-12-02 14:03:01,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:01,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 14:03:01,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:01,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 14:03:01,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 14:03:01,961 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:03:02,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:02,135 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2024-12-02 14:03:02,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 14:03:02,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-12-02 14:03:02,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:02,137 INFO L225 Difference]: With dead ends: 154 [2024-12-02 14:03:02,137 INFO L226 Difference]: Without dead ends: 154 [2024-12-02 14:03:02,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-12-02 14:03:02,137 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 96 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:02,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 199 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:03:02,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-12-02 14:03:02,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 97. [2024-12-02 14:03:02,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 96 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:03:02,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2024-12-02 14:03:02,141 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 17 [2024-12-02 14:03:02,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:02,141 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2024-12-02 14:03:02,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:03:02,141 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2024-12-02 14:03:02,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-02 14:03:02,141 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:02,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:03:02,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 14:03:02,142 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:02,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:02,142 INFO L85 PathProgramCache]: Analyzing trace with hash 578636058, now seen corresponding path program 1 times [2024-12-02 14:03:02,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:02,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021485766] [2024-12-02 14:03:02,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:02,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:02,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:02,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:02,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021485766] [2024-12-02 14:03:02,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021485766] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:02,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:02,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:03:02,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263573536] [2024-12-02 14:03:02,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:02,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:03:02,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:02,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:03:02,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:03:02,312 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:03:02,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:02,480 INFO L93 Difference]: Finished difference Result 156 states and 173 transitions. [2024-12-02 14:03:02,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 14:03:02,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-12-02 14:03:02,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:02,482 INFO L225 Difference]: With dead ends: 156 [2024-12-02 14:03:02,482 INFO L226 Difference]: Without dead ends: 156 [2024-12-02 14:03:02,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:03:02,483 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 79 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:02,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 215 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:03:02,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-12-02 14:03:02,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 97. [2024-12-02 14:03:02,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.542857142857143) internal successors, (108), 96 states have internal predecessors, (108), 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-12-02 14:03:02,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2024-12-02 14:03:02,486 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 17 [2024-12-02 14:03:02,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:02,486 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2024-12-02 14:03:02,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:03:02,487 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2024-12-02 14:03:02,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-02 14:03:02,487 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:02,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:03:02,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 14:03:02,487 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:02,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:02,488 INFO L85 PathProgramCache]: Analyzing trace with hash 578639929, now seen corresponding path program 1 times [2024-12-02 14:03:02,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:02,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306778502] [2024-12-02 14:03:02,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:02,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:02,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:02,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:02,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306778502] [2024-12-02 14:03:02,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306778502] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:02,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:02,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:03:02,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401840634] [2024-12-02 14:03:02,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:02,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:03:02,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:02,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:03:02,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:03:02,586 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:03:02,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:02,665 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2024-12-02 14:03:02,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 14:03:02,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-12-02 14:03:02,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:02,666 INFO L225 Difference]: With dead ends: 155 [2024-12-02 14:03:02,666 INFO L226 Difference]: Without dead ends: 155 [2024-12-02 14:03:02,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:03:02,667 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 85 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:02,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 293 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:03:02,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-12-02 14:03:02,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 97. [2024-12-02 14:03:02,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 96 states have internal predecessors, (107), 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-12-02 14:03:02,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2024-12-02 14:03:02,671 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 17 [2024-12-02 14:03:02,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:02,671 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2024-12-02 14:03:02,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:03:02,671 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2024-12-02 14:03:02,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-02 14:03:02,672 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:02,672 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:03:02,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 14:03:02,672 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:02,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:02,673 INFO L85 PathProgramCache]: Analyzing trace with hash -816149474, now seen corresponding path program 1 times [2024-12-02 14:03:02,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:02,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655713129] [2024-12-02 14:03:02,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:02,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:02,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:02,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655713129] [2024-12-02 14:03:02,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655713129] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:03:02,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344325977] [2024-12-02 14:03:02,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:02,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:03:02,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:03:02,858 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:03:02,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 14:03:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:02,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-02 14:03:02,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:03:02,986 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-12-02 14:03:03,019 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-12-02 14:03:03,019 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-12-02 14:03:03,062 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 19 treesize of output 1 [2024-12-02 14:03:03,161 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 14:03:03,161 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 42 treesize of output 41 [2024-12-02 14:03:03,195 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 31 treesize of output 13 [2024-12-02 14:03:03,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 14:03:03,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:03:03,263 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_203 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_203) |c_ULTIMATE.start_create_data_~data~0#1.base|) (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) 1)) is different from false [2024-12-02 14:03:03,278 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_203 (Array Int Int))) (= 1 (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) v_ArrVal_203) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))))) is different from false [2024-12-02 14:03:03,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:03,296 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 24 treesize of output 25 [2024-12-02 14:03:03,300 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 40 treesize of output 28 [2024-12-02 14:03:03,311 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 9 treesize of output 5 [2024-12-02 14:03:03,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-12-02 14:03:03,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344325977] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:03:03,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:03:03,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2024-12-02 14:03:03,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53116038] [2024-12-02 14:03:03,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:03:03,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-12-02 14:03:03,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:03,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-12-02 14:03:03,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=138, Unknown=2, NotChecked=50, Total=240 [2024-12-02 14:03:03,367 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 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-12-02 14:03:03,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:03,630 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2024-12-02 14:03:03,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 14:03:03,631 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 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 19 [2024-12-02 14:03:03,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:03,632 INFO L225 Difference]: With dead ends: 99 [2024-12-02 14:03:03,632 INFO L226 Difference]: Without dead ends: 99 [2024-12-02 14:03:03,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=138, Unknown=2, NotChecked=50, Total=240 [2024-12-02 14:03:03,633 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 8 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:03,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 474 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 330 Invalid, 0 Unknown, 99 Unchecked, 0.2s Time] [2024-12-02 14:03:03,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-12-02 14:03:03,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2024-12-02 14:03:03,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.5142857142857142) internal successors, (106), 95 states have internal predecessors, (106), 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-12-02 14:03:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2024-12-02 14:03:03,636 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 19 [2024-12-02 14:03:03,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:03,636 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2024-12-02 14:03:03,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 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-12-02 14:03:03,636 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2024-12-02 14:03:03,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-02 14:03:03,637 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:03,637 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:03:03,644 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 14:03:03,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:03:03,837 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:03,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:03,838 INFO L85 PathProgramCache]: Analyzing trace with hash -816149473, now seen corresponding path program 1 times [2024-12-02 14:03:03,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:03,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029746081] [2024-12-02 14:03:03,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:03,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:04,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:04,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:04,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029746081] [2024-12-02 14:03:04,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029746081] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:03:04,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806035306] [2024-12-02 14:03:04,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:04,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:03:04,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:03:04,167 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:03:04,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 14:03:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:04,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-12-02 14:03:04,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:03:04,265 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-12-02 14:03:04,281 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 14:03:04,281 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-12-02 14:03:04,287 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 8 treesize of output 1 [2024-12-02 14:03:04,313 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 19 treesize of output 1 [2024-12-02 14:03:04,320 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-12-02 14:03:04,448 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 14:03:04,448 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 62 treesize of output 57 [2024-12-02 14:03:04,454 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 30 treesize of output 13 [2024-12-02 14:03:04,517 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 31 treesize of output 13 [2024-12-02 14:03:04,522 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 9 treesize of output 3 [2024-12-02 14:03:04,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:04,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:03:04,729 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_260) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_260 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_260) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))) is different from false [2024-12-02 14:03:04,749 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_260 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_260) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_260) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))))))) is different from false [2024-12-02 14:03:04,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:04,760 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 45 treesize of output 46 [2024-12-02 14:03:04,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:04,768 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 35 treesize of output 36 [2024-12-02 14:03:04,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 62 treesize of output 50 [2024-12-02 14:03:04,778 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 96 treesize of output 78 [2024-12-02 14:03:04,786 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 15 treesize of output 11 [2024-12-02 14:03:04,788 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-12-02 14:03:04,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:04,798 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 1 case distinctions, treesize of input 24 treesize of output 25 [2024-12-02 14:03:04,801 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:03:04,803 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 22 treesize of output 10 [2024-12-02 14:03:04,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-12-02 14:03:04,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806035306] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:03:04,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:03:04,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 23 [2024-12-02 14:03:04,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312100471] [2024-12-02 14:03:04,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:03:04,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-12-02 14:03:04,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:04,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-12-02 14:03:04,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=386, Unknown=6, NotChecked=82, Total=552 [2024-12-02 14:03:04,853 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 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-12-02 14:03:05,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:05,508 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2024-12-02 14:03:05,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 14:03:05,508 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 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 19 [2024-12-02 14:03:05,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:05,509 INFO L225 Difference]: With dead ends: 106 [2024-12-02 14:03:05,509 INFO L226 Difference]: Without dead ends: 106 [2024-12-02 14:03:05,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=757, Unknown=7, NotChecked=118, Total=1056 [2024-12-02 14:03:05,510 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 74 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 6 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:05,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 644 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 470 Invalid, 18 Unknown, 115 Unchecked, 0.4s Time] [2024-12-02 14:03:05,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-12-02 14:03:05,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-12-02 14:03:05,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 80 states have (on average 1.4625) internal successors, (117), 105 states have internal predecessors, (117), 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-12-02 14:03:05,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2024-12-02 14:03:05,513 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 19 [2024-12-02 14:03:05,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:05,513 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2024-12-02 14:03:05,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 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-12-02 14:03:05,513 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2024-12-02 14:03:05,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-02 14:03:05,514 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:05,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:03:05,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 14:03:05,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:03:05,714 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:05,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:05,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1851887477, now seen corresponding path program 1 times [2024-12-02 14:03:05,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:05,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551319289] [2024-12-02 14:03:05,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:05,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:05,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:05,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:05,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551319289] [2024-12-02 14:03:05,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551319289] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:05,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:05,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:03:05,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020185431] [2024-12-02 14:03:05,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:05,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 14:03:05,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:05,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 14:03:05,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 14:03:05,800 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:03:05,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:05,954 INFO L93 Difference]: Finished difference Result 169 states and 183 transitions. [2024-12-02 14:03:05,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 14:03:05,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-12-02 14:03:05,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:05,955 INFO L225 Difference]: With dead ends: 169 [2024-12-02 14:03:05,955 INFO L226 Difference]: Without dead ends: 169 [2024-12-02 14:03:05,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-12-02 14:03:05,956 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 70 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:05,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 229 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:03:05,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-12-02 14:03:05,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 106. [2024-12-02 14:03:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 80 states have (on average 1.45) internal successors, (116), 105 states have internal predecessors, (116), 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-12-02 14:03:05,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2024-12-02 14:03:05,959 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 20 [2024-12-02 14:03:05,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:05,959 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2024-12-02 14:03:05,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:03:05,959 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2024-12-02 14:03:05,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-02 14:03:05,960 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:05,960 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:03:05,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 14:03:05,960 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:05,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:05,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1851887476, now seen corresponding path program 1 times [2024-12-02 14:03:05,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:05,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310487966] [2024-12-02 14:03:05,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:05,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:06,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:06,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:06,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310487966] [2024-12-02 14:03:06,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310487966] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:06,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:06,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:03:06,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195512214] [2024-12-02 14:03:06,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:06,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:03:06,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:06,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:03:06,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:03:06,088 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:03:06,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:06,235 INFO L93 Difference]: Finished difference Result 168 states and 187 transitions. [2024-12-02 14:03:06,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 14:03:06,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-12-02 14:03:06,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:06,236 INFO L225 Difference]: With dead ends: 168 [2024-12-02 14:03:06,236 INFO L226 Difference]: Without dead ends: 168 [2024-12-02 14:03:06,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:03:06,237 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 51 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:06,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 218 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:03:06,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-12-02 14:03:06,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 122. [2024-12-02 14:03:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 121 states have internal predecessors, (133), 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-12-02 14:03:06,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2024-12-02 14:03:06,240 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 20 [2024-12-02 14:03:06,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:06,240 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2024-12-02 14:03:06,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:03:06,241 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2024-12-02 14:03:06,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-02 14:03:06,241 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:06,241 INFO L218 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] [2024-12-02 14:03:06,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 14:03:06,241 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:06,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:06,242 INFO L85 PathProgramCache]: Analyzing trace with hash -724838530, now seen corresponding path program 1 times [2024-12-02 14:03:06,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:06,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57643460] [2024-12-02 14:03:06,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:06,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:06,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:06,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:06,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57643460] [2024-12-02 14:03:06,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57643460] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:06,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:06,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 14:03:06,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404085395] [2024-12-02 14:03:06,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:06,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 14:03:06,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:06,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 14:03:06,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-12-02 14:03:06,489 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:03:06,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:06,676 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2024-12-02 14:03:06,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 14:03:06,677 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-12-02 14:03:06,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:06,677 INFO L225 Difference]: With dead ends: 149 [2024-12-02 14:03:06,677 INFO L226 Difference]: Without dead ends: 149 [2024-12-02 14:03:06,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-12-02 14:03:06,678 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 35 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:06,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 439 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:03:06,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-12-02 14:03:06,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 137. [2024-12-02 14:03:06,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 111 states have (on average 1.3423423423423424) internal successors, (149), 136 states have internal predecessors, (149), 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-12-02 14:03:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2024-12-02 14:03:06,681 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 23 [2024-12-02 14:03:06,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:06,681 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2024-12-02 14:03:06,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 14:03:06,681 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2024-12-02 14:03:06,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-02 14:03:06,682 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:06,682 INFO L218 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] [2024-12-02 14:03:06,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 14:03:06,682 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:06,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:06,683 INFO L85 PathProgramCache]: Analyzing trace with hash -785157605, now seen corresponding path program 1 times [2024-12-02 14:03:06,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:06,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012140347] [2024-12-02 14:03:06,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:06,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:06,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:06,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:06,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012140347] [2024-12-02 14:03:06,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012140347] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:06,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:06,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:03:06,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253146053] [2024-12-02 14:03:06,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:06,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:03:06,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:06,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:03:06,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:03:06,758 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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-12-02 14:03:06,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:06,818 INFO L93 Difference]: Finished difference Result 165 states and 181 transitions. [2024-12-02 14:03:06,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:03:06,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 25 [2024-12-02 14:03:06,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:06,820 INFO L225 Difference]: With dead ends: 165 [2024-12-02 14:03:06,820 INFO L226 Difference]: Without dead ends: 165 [2024-12-02 14:03:06,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:03:06,821 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:06,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 225 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:03:06,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-12-02 14:03:06,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 149. [2024-12-02 14:03:06,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 123 states have (on average 1.4146341463414633) internal successors, (174), 148 states have internal predecessors, (174), 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-12-02 14:03:06,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 174 transitions. [2024-12-02 14:03:06,825 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 174 transitions. Word has length 25 [2024-12-02 14:03:06,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:06,826 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 174 transitions. [2024-12-02 14:03:06,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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-12-02 14:03:06,826 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 174 transitions. [2024-12-02 14:03:06,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-02 14:03:06,826 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:06,826 INFO L218 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] [2024-12-02 14:03:06,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 14:03:06,827 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:06,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:06,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1429918191, now seen corresponding path program 1 times [2024-12-02 14:03:06,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:06,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385889468] [2024-12-02 14:03:06,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:06,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:06,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:06,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:06,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385889468] [2024-12-02 14:03:06,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385889468] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:06,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:06,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:03:06,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155049013] [2024-12-02 14:03:06,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:06,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:03:06,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:06,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:03:06,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:03:06,912 INFO L87 Difference]: Start difference. First operand 149 states and 174 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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-12-02 14:03:07,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:07,016 INFO L93 Difference]: Finished difference Result 212 states and 232 transitions. [2024-12-02 14:03:07,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 14:03:07,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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 26 [2024-12-02 14:03:07,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:07,017 INFO L225 Difference]: With dead ends: 212 [2024-12-02 14:03:07,017 INFO L226 Difference]: Without dead ends: 212 [2024-12-02 14:03:07,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:03:07,018 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 71 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:07,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 250 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:03:07,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-12-02 14:03:07,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 150. [2024-12-02 14:03:07,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 124 states have (on average 1.4112903225806452) internal successors, (175), 149 states have internal predecessors, (175), 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-12-02 14:03:07,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 175 transitions. [2024-12-02 14:03:07,022 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 175 transitions. Word has length 26 [2024-12-02 14:03:07,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:07,022 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 175 transitions. [2024-12-02 14:03:07,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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-12-02 14:03:07,022 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 175 transitions. [2024-12-02 14:03:07,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-02 14:03:07,023 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:07,023 INFO L218 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-12-02 14:03:07,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 14:03:07,023 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:07,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:07,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1377791133, now seen corresponding path program 1 times [2024-12-02 14:03:07,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:07,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961778906] [2024-12-02 14:03:07,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:07,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:07,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:07,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:07,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961778906] [2024-12-02 14:03:07,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961778906] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:07,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:07,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:03:07,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904603860] [2024-12-02 14:03:07,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:07,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 14:03:07,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:07,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 14:03:07,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 14:03:07,121 INFO L87 Difference]: Start difference. First operand 150 states and 175 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 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-12-02 14:03:07,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:07,260 INFO L93 Difference]: Finished difference Result 215 states and 236 transitions. [2024-12-02 14:03:07,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 14:03:07,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 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-12-02 14:03:07,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:07,261 INFO L225 Difference]: With dead ends: 215 [2024-12-02 14:03:07,261 INFO L226 Difference]: Without dead ends: 215 [2024-12-02 14:03:07,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-12-02 14:03:07,262 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 79 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:07,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 207 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:03:07,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-12-02 14:03:07,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 153. [2024-12-02 14:03:07,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 127 states have (on average 1.4015748031496063) internal successors, (178), 152 states have internal predecessors, (178), 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-12-02 14:03:07,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 178 transitions. [2024-12-02 14:03:07,265 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 178 transitions. Word has length 27 [2024-12-02 14:03:07,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:07,265 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 178 transitions. [2024-12-02 14:03:07,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 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-12-02 14:03:07,265 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 178 transitions. [2024-12-02 14:03:07,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-02 14:03:07,266 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:07,266 INFO L218 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-12-02 14:03:07,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-02 14:03:07,266 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:07,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:07,266 INFO L85 PathProgramCache]: Analyzing trace with hash -238147662, now seen corresponding path program 1 times [2024-12-02 14:03:07,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:07,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195476777] [2024-12-02 14:03:07,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:07,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:07,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:07,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:07,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195476777] [2024-12-02 14:03:07,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195476777] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:07,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:07,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 14:03:07,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604845160] [2024-12-02 14:03:07,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:07,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 14:03:07,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:07,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 14:03:07,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:03:07,415 INFO L87 Difference]: Start difference. First operand 153 states and 178 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 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-12-02 14:03:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:07,545 INFO L93 Difference]: Finished difference Result 174 states and 192 transitions. [2024-12-02 14:03:07,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 14:03:07,545 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 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-12-02 14:03:07,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:07,546 INFO L225 Difference]: With dead ends: 174 [2024-12-02 14:03:07,546 INFO L226 Difference]: Without dead ends: 174 [2024-12-02 14:03:07,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-12-02 14:03:07,547 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 154 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:07,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 152 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:03:07,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-12-02 14:03:07,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 154. [2024-12-02 14:03:07,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 128 states have (on average 1.40625) internal successors, (180), 153 states have internal predecessors, (180), 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-12-02 14:03:07,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 180 transitions. [2024-12-02 14:03:07,551 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 180 transitions. Word has length 28 [2024-12-02 14:03:07,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:07,551 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 180 transitions. [2024-12-02 14:03:07,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 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-12-02 14:03:07,552 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 180 transitions. [2024-12-02 14:03:07,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-02 14:03:07,552 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:07,552 INFO L218 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-12-02 14:03:07,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-02 14:03:07,552 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:07,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:07,553 INFO L85 PathProgramCache]: Analyzing trace with hash -238147661, now seen corresponding path program 1 times [2024-12-02 14:03:07,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:07,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687448713] [2024-12-02 14:03:07,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:07,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:07,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:07,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:07,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687448713] [2024-12-02 14:03:07,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687448713] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:07,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:07,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 14:03:07,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126251924] [2024-12-02 14:03:07,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:07,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 14:03:07,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:07,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 14:03:07,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:03:07,595 INFO L87 Difference]: Start difference. First operand 154 states and 180 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 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-12-02 14:03:07,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:07,640 INFO L93 Difference]: Finished difference Result 149 states and 172 transitions. [2024-12-02 14:03:07,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 14:03:07,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 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-12-02 14:03:07,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:07,641 INFO L225 Difference]: With dead ends: 149 [2024-12-02 14:03:07,641 INFO L226 Difference]: Without dead ends: 149 [2024-12-02 14:03:07,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 14:03:07,642 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 59 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:07,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 54 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:03:07,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-12-02 14:03:07,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-12-02 14:03:07,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 128 states have (on average 1.34375) internal successors, (172), 148 states have internal predecessors, (172), 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-12-02 14:03:07,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2024-12-02 14:03:07,645 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 28 [2024-12-02 14:03:07,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:07,645 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2024-12-02 14:03:07,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 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-12-02 14:03:07,645 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2024-12-02 14:03:07,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-02 14:03:07,645 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:07,645 INFO L218 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-12-02 14:03:07,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-02 14:03:07,645 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:07,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:07,646 INFO L85 PathProgramCache]: Analyzing trace with hash 636225185, now seen corresponding path program 1 times [2024-12-02 14:03:07,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:07,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529758979] [2024-12-02 14:03:07,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:07,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:07,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:07,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:07,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529758979] [2024-12-02 14:03:07,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529758979] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:07,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:07,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 14:03:07,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026653862] [2024-12-02 14:03:07,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:07,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 14:03:07,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:07,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 14:03:07,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-12-02 14:03:07,902 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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-12-02 14:03:08,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:08,194 INFO L93 Difference]: Finished difference Result 171 states and 187 transitions. [2024-12-02 14:03:08,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 14:03:08,196 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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-12-02 14:03:08,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:08,197 INFO L225 Difference]: With dead ends: 171 [2024-12-02 14:03:08,197 INFO L226 Difference]: Without dead ends: 171 [2024-12-02 14:03:08,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-12-02 14:03:08,198 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 76 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:08,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 343 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 14:03:08,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-12-02 14:03:08,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 154. [2024-12-02 14:03:08,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 134 states have (on average 1.335820895522388) internal successors, (179), 153 states have internal predecessors, (179), 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-12-02 14:03:08,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 179 transitions. [2024-12-02 14:03:08,204 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 179 transitions. Word has length 28 [2024-12-02 14:03:08,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:08,204 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 179 transitions. [2024-12-02 14:03:08,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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-12-02 14:03:08,204 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 179 transitions. [2024-12-02 14:03:08,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-02 14:03:08,205 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:08,205 INFO L218 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-12-02 14:03:08,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-02 14:03:08,205 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:08,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:08,205 INFO L85 PathProgramCache]: Analyzing trace with hash 636225186, now seen corresponding path program 1 times [2024-12-02 14:03:08,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:08,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151156073] [2024-12-02 14:03:08,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:08,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:08,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:08,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:08,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151156073] [2024-12-02 14:03:08,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151156073] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:08,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:08,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 14:03:08,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099650225] [2024-12-02 14:03:08,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:08,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 14:03:08,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:08,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 14:03:08,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-12-02 14:03:08,535 INFO L87 Difference]: Start difference. First operand 154 states and 179 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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-12-02 14:03:08,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:08,873 INFO L93 Difference]: Finished difference Result 172 states and 188 transitions. [2024-12-02 14:03:08,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 14:03:08,873 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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-12-02 14:03:08,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:08,874 INFO L225 Difference]: With dead ends: 172 [2024-12-02 14:03:08,874 INFO L226 Difference]: Without dead ends: 172 [2024-12-02 14:03:08,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-12-02 14:03:08,875 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 64 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:08,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 475 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 14:03:08,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-12-02 14:03:08,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 154. [2024-12-02 14:03:08,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 134 states have (on average 1.3059701492537314) internal successors, (175), 153 states have internal predecessors, (175), 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-12-02 14:03:08,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 175 transitions. [2024-12-02 14:03:08,879 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 175 transitions. Word has length 28 [2024-12-02 14:03:08,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:08,879 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 175 transitions. [2024-12-02 14:03:08,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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-12-02 14:03:08,879 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 175 transitions. [2024-12-02 14:03:08,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-02 14:03:08,880 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:08,880 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:03:08,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-02 14:03:08,880 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:08,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:08,880 INFO L85 PathProgramCache]: Analyzing trace with hash 834352447, now seen corresponding path program 2 times [2024-12-02 14:03:08,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:08,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954653572] [2024-12-02 14:03:08,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 14:03:08,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:08,904 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 14:03:08,904 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 14:03:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:09,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:09,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954653572] [2024-12-02 14:03:09,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954653572] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:03:09,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338680089] [2024-12-02 14:03:09,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 14:03:09,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:03:09,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:03:09,323 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:03:09,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 14:03:09,441 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 14:03:09,442 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 14:03:09,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-12-02 14:03:09,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:03:09,449 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-12-02 14:03:09,463 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 14:03:09,463 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-12-02 14:03:09,468 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 8 treesize of output 1 [2024-12-02 14:03:09,497 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 19 treesize of output 1 [2024-12-02 14:03:09,503 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-12-02 14:03:09,636 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 14:03:09,636 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 62 treesize of output 57 [2024-12-02 14:03:09,640 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 30 treesize of output 13 [2024-12-02 14:03:09,750 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 14:03:09,751 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 62 treesize of output 57 [2024-12-02 14:03:09,755 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 30 treesize of output 13 [2024-12-02 14:03:09,871 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 14:03:09,871 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 62 treesize of output 57 [2024-12-02 14:03:09,879 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 30 treesize of output 13 [2024-12-02 14:03:09,932 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 31 treesize of output 13 [2024-12-02 14:03:09,937 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 9 treesize of output 3 [2024-12-02 14:03:09,962 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:09,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:03:10,067 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse0 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_596 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_596) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 4))) (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_596) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))))) is different from false [2024-12-02 14:03:10,086 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_596) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_597) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_596 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_596) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 4)))))) is different from false [2024-12-02 14:03:10,110 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_596 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_596) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_596) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_597) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))) is different from false [2024-12-02 14:03:10,125 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse0 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_595 (Array Int Int)) (v_ArrVal_594 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_595) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_594) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) v_ArrVal_596) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 8))) (forall ((v_ArrVal_595 (Array Int Int)) (v_ArrVal_594 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_594))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_595) .cse2 v_ArrVal_596) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_597) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))))))) is different from false [2024-12-02 14:03:10,239 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse3 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_595 (Array Int Int)) (v_ArrVal_594 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_594))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_595) .cse1 v_ArrVal_596) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 16) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_597) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (forall ((v_ArrVal_595 (Array Int Int)) (v_ArrVal_594 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_595) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_594) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_596) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 12)))))) is different from false [2024-12-02 14:03:10,261 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_592 (Array Int Int)) (v_ArrVal_595 (Array Int Int)) (v_ArrVal_594 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_593))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_592) .cse1 v_ArrVal_595) (select (select (store .cse2 .cse1 v_ArrVal_594) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_596))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 12))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_592 (Array Int Int)) (v_ArrVal_595 (Array Int Int)) (v_ArrVal_594 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_593))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_594))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (<= (+ .cse0 16 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_592) .cse4 v_ArrVal_595) .cse5 v_ArrVal_596) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_597) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))))))) is different from false [2024-12-02 14:03:10,325 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (and (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_592 (Array Int Int)) (v_ArrVal_595 (Array Int Int)) (v_ArrVal_594 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_593))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_594))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (<= (+ .cse0 16 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_592) .cse2 v_ArrVal_595) .cse3 v_ArrVal_596) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_597) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))))))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_592 (Array Int Int)) (v_ArrVal_595 (Array Int Int)) (v_ArrVal_594 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (<= 0 (+ .cse0 12 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_593))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_592) .cse7 v_ArrVal_595) (select (select (store .cse8 .cse7 v_ArrVal_594) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_596))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))))))) is different from false [2024-12-02 14:03:10,353 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_592 (Array Int Int)) (v_ArrVal_595 (Array Int Int)) (v_ArrVal_594 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_593))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_594))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (<= (+ 16 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_592) .cse1 v_ArrVal_595) .cse2 v_ArrVal_596) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_597) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_592 (Array Int Int)) (v_ArrVal_595 (Array Int Int)) (v_ArrVal_594 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (<= 0 (+ 12 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_593))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_592) .cse6 v_ArrVal_595) (select (select (store .cse7 .cse6 v_ArrVal_594) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_596))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) is different from false [2024-12-02 14:03:10,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:10,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 91 [2024-12-02 14:03:10,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:10,370 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 80 treesize of output 61 [2024-12-02 14:03:10,375 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 738 treesize of output 636 [2024-12-02 14:03:10,388 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 641 treesize of output 605 [2024-12-02 14:03:10,398 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 160 treesize of output 144 [2024-12-02 14:03:10,401 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 144 treesize of output 136 [2024-12-02 14:03:10,404 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 136 treesize of output 124 [2024-12-02 14:03:10,408 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 124 treesize of output 104 [2024-12-02 14:03:10,413 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 76 treesize of output 72 [2024-12-02 14:03:10,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:10,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 178 [2024-12-02 14:03:10,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:10,452 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 1 case distinctions, treesize of input 167 treesize of output 108 [2024-12-02 14:03:10,455 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:03:10,458 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 460 treesize of output 310 [2024-12-02 14:03:10,463 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:03:10,464 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-12-02 14:03:10,519 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2024-12-02 14:03:10,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338680089] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:03:10,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:03:10,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 15] total 37 [2024-12-02 14:03:10,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112666598] [2024-12-02 14:03:10,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:03:10,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-12-02 14:03:10,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:10,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-12-02 14:03:10,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=737, Unknown=13, NotChecked=504, Total=1406 [2024-12-02 14:03:10,521 INFO L87 Difference]: Start difference. First operand 154 states and 175 transitions. Second operand has 38 states, 37 states have (on average 2.0) internal successors, (74), 38 states have internal predecessors, (74), 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-12-02 14:03:11,885 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)) (.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_596 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_596) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 4))) (<= (+ .cse1 |c_ULTIMATE.start_create_data_#t~mem7#1.offset| 4) (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem7#1.base|)) (<= 0 (+ .cse1 |c_ULTIMATE.start_create_data_#t~mem7#1.offset|)) (= (select |c_#valid| |c_ULTIMATE.start_create_data_~data~0#1.base|) 1) (<= 0 (+ .cse1 .cse2)) (<= (+ .cse1 .cse2 4) (select |c_#length| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_596) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))))))) is different from false [2024-12-02 14:03:12,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:12,059 INFO L93 Difference]: Finished difference Result 177 states and 199 transitions. [2024-12-02 14:03:12,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-12-02 14:03:12,059 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.0) internal successors, (74), 38 states have internal predecessors, (74), 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-12-02 14:03:12,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:12,060 INFO L225 Difference]: With dead ends: 177 [2024-12-02 14:03:12,060 INFO L226 Difference]: Without dead ends: 177 [2024-12-02 14:03:12,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=363, Invalid=1696, Unknown=47, NotChecked=864, Total=2970 [2024-12-02 14:03:12,061 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 120 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 18 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 602 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:12,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 903 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 586 Invalid, 18 Unknown, 602 Unchecked, 0.5s Time] [2024-12-02 14:03:12,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-12-02 14:03:12,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2024-12-02 14:03:12,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 154 states have (on average 1.2727272727272727) internal successors, (196), 173 states have internal predecessors, (196), 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-12-02 14:03:12,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 196 transitions. [2024-12-02 14:03:12,065 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 196 transitions. Word has length 29 [2024-12-02 14:03:12,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:12,066 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 196 transitions. [2024-12-02 14:03:12,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.0) internal successors, (74), 38 states have internal predecessors, (74), 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-12-02 14:03:12,066 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 196 transitions. [2024-12-02 14:03:12,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-02 14:03:12,066 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:12,066 INFO L218 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-12-02 14:03:12,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-12-02 14:03:12,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:03:12,267 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:12,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:12,267 INFO L85 PathProgramCache]: Analyzing trace with hash 93891540, now seen corresponding path program 1 times [2024-12-02 14:03:12,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:12,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942653053] [2024-12-02 14:03:12,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:12,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:12,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:12,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:12,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942653053] [2024-12-02 14:03:12,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942653053] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:12,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:12,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:03:12,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734239499] [2024-12-02 14:03:12,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:12,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:03:12,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:12,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:03:12,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:03:12,324 INFO L87 Difference]: Start difference. First operand 174 states and 196 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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-12-02 14:03:12,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:12,382 INFO L93 Difference]: Finished difference Result 173 states and 194 transitions. [2024-12-02 14:03:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:03:12,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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-12-02 14:03:12,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:12,383 INFO L225 Difference]: With dead ends: 173 [2024-12-02 14:03:12,383 INFO L226 Difference]: Without dead ends: 173 [2024-12-02 14:03:12,384 INFO L434 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-12-02 14:03:12,384 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 6 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:12,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 241 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 14:03:12,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-12-02 14:03:12,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-12-02 14:03:12,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 154 states have (on average 1.2597402597402598) internal successors, (194), 172 states have internal predecessors, (194), 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-12-02 14:03:12,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 194 transitions. [2024-12-02 14:03:12,388 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 194 transitions. Word has length 31 [2024-12-02 14:03:12,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:12,388 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 194 transitions. [2024-12-02 14:03:12,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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-12-02 14:03:12,388 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 194 transitions. [2024-12-02 14:03:12,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-02 14:03:12,389 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:12,389 INFO L218 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-12-02 14:03:12,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-12-02 14:03:12,389 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:12,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:12,389 INFO L85 PathProgramCache]: Analyzing trace with hash 93902525, now seen corresponding path program 1 times [2024-12-02 14:03:12,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:12,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201152259] [2024-12-02 14:03:12,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:12,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:12,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:12,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:12,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201152259] [2024-12-02 14:03:12,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201152259] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:12,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:12,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 14:03:12,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959600530] [2024-12-02 14:03:12,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:12,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 14:03:12,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:12,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 14:03:12,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-12-02 14:03:12,694 INFO L87 Difference]: Start difference. First operand 173 states and 194 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 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-12-02 14:03:13,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:13,000 INFO L93 Difference]: Finished difference Result 189 states and 205 transitions. [2024-12-02 14:03:13,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 14:03:13,001 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 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-12-02 14:03:13,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:13,001 INFO L225 Difference]: With dead ends: 189 [2024-12-02 14:03:13,001 INFO L226 Difference]: Without dead ends: 189 [2024-12-02 14:03:13,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-12-02 14:03:13,002 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 51 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:13,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 510 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 14:03:13,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-12-02 14:03:13,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 173. [2024-12-02 14:03:13,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 154 states have (on average 1.2467532467532467) internal successors, (192), 172 states have internal predecessors, (192), 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-12-02 14:03:13,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 192 transitions. [2024-12-02 14:03:13,006 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 192 transitions. Word has length 31 [2024-12-02 14:03:13,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:13,006 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 192 transitions. [2024-12-02 14:03:13,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 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-12-02 14:03:13,006 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 192 transitions. [2024-12-02 14:03:13,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-02 14:03:13,006 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:13,006 INFO L218 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] [2024-12-02 14:03:13,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-02 14:03:13,007 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:13,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:13,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1384329406, now seen corresponding path program 1 times [2024-12-02 14:03:13,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:13,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990441280] [2024-12-02 14:03:13,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:13,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:13,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:13,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:13,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990441280] [2024-12-02 14:03:13,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990441280] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:13,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:13,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:03:13,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225962880] [2024-12-02 14:03:13,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:13,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 14:03:13,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:13,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 14:03:13,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-12-02 14:03:13,080 INFO L87 Difference]: Start difference. First operand 173 states and 192 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-12-02 14:03:13,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:13,164 INFO L93 Difference]: Finished difference Result 171 states and 188 transitions. [2024-12-02 14:03:13,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 14:03:13,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 32 [2024-12-02 14:03:13,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:13,165 INFO L225 Difference]: With dead ends: 171 [2024-12-02 14:03:13,165 INFO L226 Difference]: Without dead ends: 171 [2024-12-02 14:03:13,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-12-02 14:03:13,166 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 48 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:13,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 201 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:03:13,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-12-02 14:03:13,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-12-02 14:03:13,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 154 states have (on average 1.2207792207792207) internal successors, (188), 170 states have internal predecessors, (188), 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-12-02 14:03:13,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 188 transitions. [2024-12-02 14:03:13,169 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 188 transitions. Word has length 32 [2024-12-02 14:03:13,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:13,169 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 188 transitions. [2024-12-02 14:03:13,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-12-02 14:03:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 188 transitions. [2024-12-02 14:03:13,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-02 14:03:13,169 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:13,169 INFO L218 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] [2024-12-02 14:03:13,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-02 14:03:13,170 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:13,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:13,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1037365654, now seen corresponding path program 1 times [2024-12-02 14:03:13,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:13,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802060461] [2024-12-02 14:03:13,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:13,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:13,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:13,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:13,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802060461] [2024-12-02 14:03:13,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802060461] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:03:13,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498533358] [2024-12-02 14:03:13,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:13,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:03:13,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:03:13,748 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:03:13,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 14:03:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:13,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-12-02 14:03:13,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:03:13,957 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:03:13,957 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 15 treesize of output 7 [2024-12-02 14:03:14,002 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-12-02 14:03:14,007 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 11 [2024-12-02 14:03:14,119 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-12-02 14:03:14,130 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 15 [2024-12-02 14:03:14,183 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:03:14,184 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2024-12-02 14:03:14,330 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:03:14,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:14,336 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 29 treesize of output 19 [2024-12-02 14:03:14,348 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-12-02 14:03:14,349 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 29 treesize of output 19 [2024-12-02 14:03:14,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-12-02 14:03:14,606 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-12-02 14:03:14,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:14,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:03:14,854 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 8 treesize of output 4 [2024-12-02 14:03:15,039 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 350 treesize of output 318 [2024-12-02 14:03:15,068 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 56 treesize of output 40 [2024-12-02 14:03:15,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:15,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498533358] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:03:15,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:03:15,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 32 [2024-12-02 14:03:15,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001565785] [2024-12-02 14:03:15,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:03:15,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-12-02 14:03:15,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:15,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-12-02 14:03:15,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2024-12-02 14:03:15,219 INFO L87 Difference]: Start difference. First operand 171 states and 188 transitions. Second operand has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 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-12-02 14:03:15,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:15,817 INFO L93 Difference]: Finished difference Result 263 states and 286 transitions. [2024-12-02 14:03:15,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 14:03:15,817 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 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 33 [2024-12-02 14:03:15,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:15,819 INFO L225 Difference]: With dead ends: 263 [2024-12-02 14:03:15,819 INFO L226 Difference]: Without dead ends: 263 [2024-12-02 14:03:15,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=189, Invalid=1451, Unknown=0, NotChecked=0, Total=1640 [2024-12-02 14:03:15,820 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 159 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:15,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1138 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 14:03:15,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-12-02 14:03:15,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 200. [2024-12-02 14:03:15,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 183 states have (on average 1.1967213114754098) internal successors, (219), 199 states have internal predecessors, (219), 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-12-02 14:03:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 219 transitions. [2024-12-02 14:03:15,822 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 219 transitions. Word has length 33 [2024-12-02 14:03:15,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:15,823 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 219 transitions. [2024-12-02 14:03:15,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 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-12-02 14:03:15,823 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 219 transitions. [2024-12-02 14:03:15,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-02 14:03:15,823 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:15,823 INFO L218 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] [2024-12-02 14:03:15,829 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 14:03:16,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-12-02 14:03:16,024 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:16,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:16,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1037361782, now seen corresponding path program 1 times [2024-12-02 14:03:16,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:16,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831295791] [2024-12-02 14:03:16,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:16,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:16,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:16,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831295791] [2024-12-02 14:03:16,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831295791] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:03:16,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187904450] [2024-12-02 14:03:16,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:16,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:03:16,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:03:16,329 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:03:16,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 14:03:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:16,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-12-02 14:03:16,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:03:16,625 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-12-02 14:03:16,625 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 15 [2024-12-02 14:03:16,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:16,978 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 95 treesize of output 67 [2024-12-02 14:03:16,983 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 21 treesize of output 13 [2024-12-02 14:03:17,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-12-02 14:03:17,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:03:17,432 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 8 treesize of output 4 [2024-12-02 14:03:17,560 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_append_~pointerToList#1.offset| Int) (v_ArrVal_836 Int) (|v_ULTIMATE.start_append_~node~0#1.base_16| Int)) (let ((.cse0 (select (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset| |v_ULTIMATE.start_append_~node~0#1.base_16|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (= .cse0 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_16|) 0)) (= (store (store (store |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_16| v_ArrVal_836) .cse0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)))) is different from false [2024-12-02 14:03:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:17,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187904450] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:03:17,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:03:17,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 10] total 24 [2024-12-02 14:03:17,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015085878] [2024-12-02 14:03:17,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:03:17,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-12-02 14:03:17,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:17,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-12-02 14:03:17,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=474, Unknown=5, NotChecked=44, Total=600 [2024-12-02 14:03:17,567 INFO L87 Difference]: Start difference. First operand 200 states and 219 transitions. Second operand has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 25 states have internal predecessors, (92), 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-12-02 14:03:18,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:18,503 INFO L93 Difference]: Finished difference Result 212 states and 231 transitions. [2024-12-02 14:03:18,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 14:03:18,503 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 25 states have internal predecessors, (92), 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 33 [2024-12-02 14:03:18,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:18,504 INFO L225 Difference]: With dead ends: 212 [2024-12-02 14:03:18,504 INFO L226 Difference]: Without dead ends: 192 [2024-12-02 14:03:18,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=151, Invalid=778, Unknown=5, NotChecked=58, Total=992 [2024-12-02 14:03:18,505 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 26 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:18,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 648 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 582 Invalid, 0 Unknown, 77 Unchecked, 0.5s Time] [2024-12-02 14:03:18,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-12-02 14:03:18,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 182. [2024-12-02 14:03:18,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 165 states have (on average 1.2121212121212122) internal successors, (200), 181 states have internal predecessors, (200), 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-12-02 14:03:18,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 200 transitions. [2024-12-02 14:03:18,509 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 200 transitions. Word has length 33 [2024-12-02 14:03:18,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:18,509 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 200 transitions. [2024-12-02 14:03:18,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 25 states have internal predecessors, (92), 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-12-02 14:03:18,509 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 200 transitions. [2024-12-02 14:03:18,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-02 14:03:18,509 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:18,509 INFO L218 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] [2024-12-02 14:03:18,518 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 14:03:18,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-12-02 14:03:18,710 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:18,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:18,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1426572519, now seen corresponding path program 1 times [2024-12-02 14:03:18,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:18,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365848356] [2024-12-02 14:03:18,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:18,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:18,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:18,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:18,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365848356] [2024-12-02 14:03:18,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365848356] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:18,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:18,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-12-02 14:03:18,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912886718] [2024-12-02 14:03:18,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:18,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 14:03:18,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:18,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 14:03:18,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-12-02 14:03:18,998 INFO L87 Difference]: Start difference. First operand 182 states and 200 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 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-12-02 14:03:19,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:19,371 INFO L93 Difference]: Finished difference Result 199 states and 214 transitions. [2024-12-02 14:03:19,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 14:03:19,371 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 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 34 [2024-12-02 14:03:19,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:19,372 INFO L225 Difference]: With dead ends: 199 [2024-12-02 14:03:19,372 INFO L226 Difference]: Without dead ends: 199 [2024-12-02 14:03:19,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2024-12-02 14:03:19,373 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 94 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:19,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 396 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 14:03:19,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-12-02 14:03:19,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 184. [2024-12-02 14:03:19,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 167 states have (on average 1.2095808383233533) internal successors, (202), 183 states have internal predecessors, (202), 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-12-02 14:03:19,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 202 transitions. [2024-12-02 14:03:19,376 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 202 transitions. Word has length 34 [2024-12-02 14:03:19,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:19,376 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 202 transitions. [2024-12-02 14:03:19,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 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-12-02 14:03:19,376 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 202 transitions. [2024-12-02 14:03:19,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-02 14:03:19,376 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:19,377 INFO L218 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] [2024-12-02 14:03:19,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-12-02 14:03:19,378 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:19,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:19,378 INFO L85 PathProgramCache]: Analyzing trace with hash -127477783, now seen corresponding path program 1 times [2024-12-02 14:03:19,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:19,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772752052] [2024-12-02 14:03:19,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:19,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:19,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:19,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:19,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772752052] [2024-12-02 14:03:19,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772752052] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:19,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:19,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-12-02 14:03:19,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313744478] [2024-12-02 14:03:19,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:19,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-12-02 14:03:19,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:19,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-12-02 14:03:19,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-12-02 14:03:19,733 INFO L87 Difference]: Start difference. First operand 184 states and 202 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 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-12-02 14:03:20,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:20,092 INFO L93 Difference]: Finished difference Result 189 states and 203 transitions. [2024-12-02 14:03:20,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-12-02 14:03:20,093 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 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 36 [2024-12-02 14:03:20,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:20,093 INFO L225 Difference]: With dead ends: 189 [2024-12-02 14:03:20,093 INFO L226 Difference]: Without dead ends: 189 [2024-12-02 14:03:20,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2024-12-02 14:03:20,094 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 59 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:20,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 324 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 14:03:20,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-12-02 14:03:20,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 184. [2024-12-02 14:03:20,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 167 states have (on average 1.1976047904191616) internal successors, (200), 183 states have internal predecessors, (200), 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-12-02 14:03:20,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 200 transitions. [2024-12-02 14:03:20,097 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 200 transitions. Word has length 36 [2024-12-02 14:03:20,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:20,097 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 200 transitions. [2024-12-02 14:03:20,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 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-12-02 14:03:20,098 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 200 transitions. [2024-12-02 14:03:20,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-02 14:03:20,098 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:20,098 INFO L218 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] [2024-12-02 14:03:20,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-12-02 14:03:20,098 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:20,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:20,099 INFO L85 PathProgramCache]: Analyzing trace with hash 320626917, now seen corresponding path program 1 times [2024-12-02 14:03:20,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:20,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516395771] [2024-12-02 14:03:20,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:20,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:20,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:20,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:20,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516395771] [2024-12-02 14:03:20,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516395771] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:20,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:20,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-12-02 14:03:20,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050720963] [2024-12-02 14:03:20,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:20,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-12-02 14:03:20,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:20,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-12-02 14:03:20,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-12-02 14:03:20,495 INFO L87 Difference]: Start difference. First operand 184 states and 200 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 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-12-02 14:03:20,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:20,975 INFO L93 Difference]: Finished difference Result 250 states and 269 transitions. [2024-12-02 14:03:20,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-12-02 14:03:20,976 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 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 37 [2024-12-02 14:03:20,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:20,976 INFO L225 Difference]: With dead ends: 250 [2024-12-02 14:03:20,976 INFO L226 Difference]: Without dead ends: 250 [2024-12-02 14:03:20,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2024-12-02 14:03:20,977 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 106 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:20,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 494 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 14:03:20,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-12-02 14:03:20,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 187. [2024-12-02 14:03:20,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 170 states have (on average 1.1941176470588235) internal successors, (203), 186 states have internal predecessors, (203), 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-12-02 14:03:20,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 203 transitions. [2024-12-02 14:03:20,981 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 203 transitions. Word has length 37 [2024-12-02 14:03:20,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:20,981 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 203 transitions. [2024-12-02 14:03:20,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 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-12-02 14:03:20,982 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 203 transitions. [2024-12-02 14:03:20,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-02 14:03:20,982 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:20,982 INFO L218 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] [2024-12-02 14:03:20,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-12-02 14:03:20,982 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:20,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:20,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2047907340, now seen corresponding path program 1 times [2024-12-02 14:03:20,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:20,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730080408] [2024-12-02 14:03:20,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:20,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:21,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:21,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:21,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730080408] [2024-12-02 14:03:21,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730080408] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:21,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:21,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-12-02 14:03:21,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462381934] [2024-12-02 14:03:21,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:21,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-12-02 14:03:21,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:21,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-12-02 14:03:21,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2024-12-02 14:03:21,382 INFO L87 Difference]: Start difference. First operand 187 states and 203 transitions. Second operand has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 18 states have internal predecessors, (38), 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-12-02 14:03:21,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:21,803 INFO L93 Difference]: Finished difference Result 192 states and 204 transitions. [2024-12-02 14:03:21,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-02 14:03:21,803 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 18 states have internal predecessors, (38), 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 38 [2024-12-02 14:03:21,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:21,804 INFO L225 Difference]: With dead ends: 192 [2024-12-02 14:03:21,804 INFO L226 Difference]: Without dead ends: 192 [2024-12-02 14:03:21,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2024-12-02 14:03:21,804 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 175 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:21,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 386 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 14:03:21,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-12-02 14:03:21,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 187. [2024-12-02 14:03:21,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 170 states have (on average 1.188235294117647) internal successors, (202), 186 states have internal predecessors, (202), 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-12-02 14:03:21,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 202 transitions. [2024-12-02 14:03:21,807 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 202 transitions. Word has length 38 [2024-12-02 14:03:21,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:21,807 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 202 transitions. [2024-12-02 14:03:21,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 18 states have internal predecessors, (38), 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-12-02 14:03:21,808 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 202 transitions. [2024-12-02 14:03:21,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-02 14:03:21,808 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:21,808 INFO L218 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] [2024-12-02 14:03:21,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-12-02 14:03:21,808 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:21,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:21,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1349500010, now seen corresponding path program 1 times [2024-12-02 14:03:21,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:21,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169574155] [2024-12-02 14:03:21,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:21,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:21,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:21,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:21,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169574155] [2024-12-02 14:03:21,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169574155] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:21,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:21,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 14:03:21,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348901746] [2024-12-02 14:03:21,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:21,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 14:03:21,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:21,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 14:03:21,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 14:03:21,937 INFO L87 Difference]: Start difference. First operand 187 states and 202 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 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-12-02 14:03:22,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:22,036 INFO L93 Difference]: Finished difference Result 193 states and 205 transitions. [2024-12-02 14:03:22,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 14:03:22,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 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 38 [2024-12-02 14:03:22,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:22,037 INFO L225 Difference]: With dead ends: 193 [2024-12-02 14:03:22,037 INFO L226 Difference]: Without dead ends: 193 [2024-12-02 14:03:22,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-12-02 14:03:22,037 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 133 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:22,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 150 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:03:22,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-12-02 14:03:22,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 183. [2024-12-02 14:03:22,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 166 states have (on average 1.1987951807228916) internal successors, (199), 182 states have internal predecessors, (199), 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-12-02 14:03:22,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 199 transitions. [2024-12-02 14:03:22,040 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 199 transitions. Word has length 38 [2024-12-02 14:03:22,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:22,040 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 199 transitions. [2024-12-02 14:03:22,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 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-12-02 14:03:22,040 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 199 transitions. [2024-12-02 14:03:22,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-12-02 14:03:22,041 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:22,041 INFO L218 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, 1, 1] [2024-12-02 14:03:22,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-12-02 14:03:22,041 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:22,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:22,042 INFO L85 PathProgramCache]: Analyzing trace with hash -802766432, now seen corresponding path program 1 times [2024-12-02 14:03:22,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:22,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654496740] [2024-12-02 14:03:22,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:22,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:22,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:22,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:22,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654496740] [2024-12-02 14:03:22,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654496740] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:22,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:22,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-12-02 14:03:22,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267084339] [2024-12-02 14:03:22,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:22,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-12-02 14:03:22,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:22,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-12-02 14:03:22,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2024-12-02 14:03:22,640 INFO L87 Difference]: Start difference. First operand 183 states and 199 transitions. Second operand has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 20 states have internal predecessors, (41), 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-12-02 14:03:23,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:23,378 INFO L93 Difference]: Finished difference Result 258 states and 278 transitions. [2024-12-02 14:03:23,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-12-02 14:03:23,378 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 20 states have internal predecessors, (41), 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 41 [2024-12-02 14:03:23,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:23,378 INFO L225 Difference]: With dead ends: 258 [2024-12-02 14:03:23,378 INFO L226 Difference]: Without dead ends: 258 [2024-12-02 14:03:23,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=1357, Unknown=0, NotChecked=0, Total=1560 [2024-12-02 14:03:23,379 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 124 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:23,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 606 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 14:03:23,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-12-02 14:03:23,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 175. [2024-12-02 14:03:23,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 158 states have (on average 1.2025316455696202) internal successors, (190), 174 states have internal predecessors, (190), 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-12-02 14:03:23,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 190 transitions. [2024-12-02 14:03:23,381 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 190 transitions. Word has length 41 [2024-12-02 14:03:23,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:23,382 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 190 transitions. [2024-12-02 14:03:23,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 20 states have internal predecessors, (41), 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-12-02 14:03:23,382 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 190 transitions. [2024-12-02 14:03:23,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-12-02 14:03:23,382 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:23,382 INFO L218 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] [2024-12-02 14:03:23,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-12-02 14:03:23,382 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:23,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:23,383 INFO L85 PathProgramCache]: Analyzing trace with hash 660712626, now seen corresponding path program 1 times [2024-12-02 14:03:23,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:23,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8902504] [2024-12-02 14:03:23,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:23,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:23,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:23,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8902504] [2024-12-02 14:03:23,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8902504] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:23,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:23,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-12-02 14:03:23,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124926036] [2024-12-02 14:03:23,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:23,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-12-02 14:03:23,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:23,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-12-02 14:03:23,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-12-02 14:03:23,959 INFO L87 Difference]: Start difference. First operand 175 states and 190 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 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-12-02 14:03:24,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:24,342 INFO L93 Difference]: Finished difference Result 196 states and 211 transitions. [2024-12-02 14:03:24,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 14:03:24,343 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 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 43 [2024-12-02 14:03:24,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:24,343 INFO L225 Difference]: With dead ends: 196 [2024-12-02 14:03:24,343 INFO L226 Difference]: Without dead ends: 195 [2024-12-02 14:03:24,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2024-12-02 14:03:24,344 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 83 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:24,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 448 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 14:03:24,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-12-02 14:03:24,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 179. [2024-12-02 14:03:24,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 162 states have (on average 1.1975308641975309) internal successors, (194), 178 states have internal predecessors, (194), 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-12-02 14:03:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 194 transitions. [2024-12-02 14:03:24,346 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 194 transitions. Word has length 43 [2024-12-02 14:03:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:24,346 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 194 transitions. [2024-12-02 14:03:24,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 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-12-02 14:03:24,346 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 194 transitions. [2024-12-02 14:03:24,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-12-02 14:03:24,347 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:24,347 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:03:24,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-12-02 14:03:24,347 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:24,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:24,347 INFO L85 PathProgramCache]: Analyzing trace with hash 543648671, now seen corresponding path program 1 times [2024-12-02 14:03:24,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:24,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147971315] [2024-12-02 14:03:24,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:24,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:24,829 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:24,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:24,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147971315] [2024-12-02 14:03:24,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147971315] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:03:24,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121259989] [2024-12-02 14:03:24,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:24,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:03:24,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:03:24,831 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:03:24,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 14:03:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:24,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-12-02 14:03:24,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:03:24,977 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-12-02 14:03:25,039 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-12-02 14:03:25,073 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-12-02 14:03:25,073 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 23 treesize of output 24 [2024-12-02 14:03:25,163 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 11 [2024-12-02 14:03:25,268 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 27 treesize of output 15 [2024-12-02 14:03:25,339 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:03:25,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:25,342 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 52 treesize of output 39 [2024-12-02 14:03:25,501 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-12-02 14:03:25,501 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 47 treesize of output 29 [2024-12-02 14:03:25,800 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 57 treesize of output 49 [2024-12-02 14:03:25,970 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-12-02 14:03:25,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 17 [2024-12-02 14:03:26,040 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:03:26,041 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:03:26,041 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 28 treesize of output 8 [2024-12-02 14:03:26,087 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-12-02 14:03:26,089 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:26,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:03:26,267 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 8 treesize of output 4 [2024-12-02 14:03:26,432 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 486 treesize of output 454 [2024-12-02 14:03:27,014 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-12-02 14:03:27,014 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 2 case distinctions, treesize of input 93 treesize of output 91 [2024-12-02 14:03:27,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:27,023 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 91 treesize of output 89 [2024-12-02 14:03:27,034 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-12-02 14:03:27,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:27,056 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 121 treesize of output 135 [2024-12-02 14:03:27,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:27,367 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 45 treesize of output 37 [2024-12-02 14:03:27,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:27,373 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 37 treesize of output 39 [2024-12-02 14:03:27,384 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 44 treesize of output 40 [2024-12-02 14:03:27,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:27,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 75 [2024-12-02 14:03:27,521 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-12-02 14:03:27,521 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 2 case distinctions, treesize of input 100 treesize of output 98 [2024-12-02 14:03:27,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:27,529 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 98 treesize of output 96 [2024-12-02 14:03:27,536 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-12-02 14:03:27,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:27,561 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 136 treesize of output 150 [2024-12-02 14:03:31,926 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:31,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121259989] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:03:31,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:03:31,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 17] total 40 [2024-12-02 14:03:31,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015291150] [2024-12-02 14:03:31,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:03:31,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-12-02 14:03:31,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:31,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-12-02 14:03:31,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1471, Unknown=0, NotChecked=0, Total=1640 [2024-12-02 14:03:31,927 INFO L87 Difference]: Start difference. First operand 179 states and 194 transitions. Second operand has 41 states, 40 states have (on average 3.0) internal successors, (120), 41 states have internal predecessors, (120), 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-12-02 14:03:33,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:33,682 INFO L93 Difference]: Finished difference Result 295 states and 319 transitions. [2024-12-02 14:03:33,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-12-02 14:03:33,682 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.0) internal successors, (120), 41 states have internal predecessors, (120), 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 44 [2024-12-02 14:03:33,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:33,683 INFO L225 Difference]: With dead ends: 295 [2024-12-02 14:03:33,683 INFO L226 Difference]: Without dead ends: 295 [2024-12-02 14:03:33,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=388, Invalid=2474, Unknown=0, NotChecked=0, Total=2862 [2024-12-02 14:03:33,684 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 324 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:33,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1362 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-12-02 14:03:33,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-12-02 14:03:33,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 190. [2024-12-02 14:03:33,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 173 states have (on average 1.1965317919075145) internal successors, (207), 189 states have internal predecessors, (207), 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-12-02 14:03:33,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 207 transitions. [2024-12-02 14:03:33,686 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 207 transitions. Word has length 44 [2024-12-02 14:03:33,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:33,686 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 207 transitions. [2024-12-02 14:03:33,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.0) internal successors, (120), 41 states have internal predecessors, (120), 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-12-02 14:03:33,686 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 207 transitions. [2024-12-02 14:03:33,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-12-02 14:03:33,686 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:33,687 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:03:33,692 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 14:03:33,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:03:33,887 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:33,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:33,887 INFO L85 PathProgramCache]: Analyzing trace with hash 543648672, now seen corresponding path program 1 times [2024-12-02 14:03:33,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:33,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884522375] [2024-12-02 14:03:33,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:33,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:34,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:34,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884522375] [2024-12-02 14:03:34,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884522375] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:03:34,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253923502] [2024-12-02 14:03:34,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:34,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:03:34,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:03:34,552 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:03:34,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 14:03:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:34,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-12-02 14:03:34,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:03:34,727 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-12-02 14:03:34,731 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-12-02 14:03:34,852 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-12-02 14:03:34,857 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-12-02 14:03:34,908 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-12-02 14:03:34,908 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 15 treesize of output 15 [2024-12-02 14:03:34,915 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 18 treesize of output 13 [2024-12-02 14:03:34,977 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:03:34,978 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 15 treesize of output 7 [2024-12-02 14:03:35,029 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 11 [2024-12-02 14:03:35,039 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 11 treesize of output 7 [2024-12-02 14:03:35,167 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 27 treesize of output 15 [2024-12-02 14:03:35,177 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-12-02 14:03:35,258 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:03:35,259 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 25 [2024-12-02 14:03:35,447 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:03:35,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:35,452 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 29 treesize of output 19 [2024-12-02 14:03:35,460 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-12-02 14:03:35,460 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 47 treesize of output 29 [2024-12-02 14:03:35,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-12-02 14:03:35,994 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:03:35,994 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:03:35,995 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 28 treesize of output 8 [2024-12-02 14:03:36,052 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-12-02 14:03:36,081 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:36,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:03:36,355 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 8 treesize of output 4 [2024-12-02 14:03:36,627 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 366 treesize of output 334 [2024-12-02 14:03:36,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:03:36,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 14:03:36,996 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 32 treesize of output 28 [2024-12-02 14:03:37,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:37,015 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-12-02 14:03:37,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:37,022 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 19 treesize of output 23 [2024-12-02 14:03:37,028 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-12-02 14:03:37,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:37,043 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 29 treesize of output 33 [2024-12-02 14:03:37,080 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 66 treesize of output 62 [2024-12-02 14:03:37,083 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 102 treesize of output 94 [2024-12-02 14:03:37,623 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:37,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253923502] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:03:37,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:03:37,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 43 [2024-12-02 14:03:37,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183877530] [2024-12-02 14:03:37,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:03:37,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-12-02 14:03:37,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:37,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-12-02 14:03:37,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1746, Unknown=0, NotChecked=0, Total=1892 [2024-12-02 14:03:37,625 INFO L87 Difference]: Start difference. First operand 190 states and 207 transitions. Second operand has 44 states, 43 states have (on average 3.0) internal successors, (129), 44 states have internal predecessors, (129), 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-12-02 14:03:39,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:39,809 INFO L93 Difference]: Finished difference Result 302 states and 329 transitions. [2024-12-02 14:03:39,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-12-02 14:03:39,810 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 3.0) internal successors, (129), 44 states have internal predecessors, (129), 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 44 [2024-12-02 14:03:39,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:39,811 INFO L225 Difference]: With dead ends: 302 [2024-12-02 14:03:39,811 INFO L226 Difference]: Without dead ends: 302 [2024-12-02 14:03:39,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=530, Invalid=3630, Unknown=0, NotChecked=0, Total=4160 [2024-12-02 14:03:39,812 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 513 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:39,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1307 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1374 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-12-02 14:03:39,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-12-02 14:03:39,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 190. [2024-12-02 14:03:39,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 173 states have (on average 1.1907514450867052) internal successors, (206), 189 states have internal predecessors, (206), 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-12-02 14:03:39,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 206 transitions. [2024-12-02 14:03:39,814 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 206 transitions. Word has length 44 [2024-12-02 14:03:39,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:39,814 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 206 transitions. [2024-12-02 14:03:39,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 3.0) internal successors, (129), 44 states have internal predecessors, (129), 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-12-02 14:03:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 206 transitions. [2024-12-02 14:03:39,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-12-02 14:03:39,815 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:39,815 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:03:39,820 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 14:03:40,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:03:40,015 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:40,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:40,016 INFO L85 PathProgramCache]: Analyzing trace with hash 543652543, now seen corresponding path program 1 times [2024-12-02 14:03:40,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:40,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787856578] [2024-12-02 14:03:40,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:40,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:40,385 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:40,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:40,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787856578] [2024-12-02 14:03:40,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787856578] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:03:40,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574283775] [2024-12-02 14:03:40,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:40,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:03:40,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:03:40,387 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:03:40,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 14:03:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:40,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-12-02 14:03:40,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:03:40,615 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-12-02 14:03:40,714 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 11 [2024-12-02 14:03:40,792 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 15 [2024-12-02 14:03:40,835 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:03:40,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:40,837 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 39 treesize of output 30 [2024-12-02 14:03:40,949 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-12-02 14:03:40,949 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 30 treesize of output 20 [2024-12-02 14:03:41,037 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 21 treesize of output 13 [2024-12-02 14:03:41,081 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-12-02 14:03:41,108 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-12-02 14:03:41,109 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:41,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:03:41,212 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 8 treesize of output 4 [2024-12-02 14:03:41,340 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 358 treesize of output 326 [2024-12-02 14:03:41,474 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 26 [2024-12-02 14:03:41,643 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:41,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574283775] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:03:41,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:03:41,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 17] total 36 [2024-12-02 14:03:41,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290183289] [2024-12-02 14:03:41,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:03:41,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-12-02 14:03:41,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:41,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-12-02 14:03:41,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1119, Unknown=0, NotChecked=0, Total=1260 [2024-12-02 14:03:41,645 INFO L87 Difference]: Start difference. First operand 190 states and 206 transitions. Second operand has 36 states, 36 states have (on average 3.2777777777777777) internal successors, (118), 36 states have internal predecessors, (118), 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-12-02 14:03:42,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:42,316 INFO L93 Difference]: Finished difference Result 297 states and 324 transitions. [2024-12-02 14:03:42,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-02 14:03:42,317 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.2777777777777777) internal successors, (118), 36 states have internal predecessors, (118), 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 44 [2024-12-02 14:03:42,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:42,317 INFO L225 Difference]: With dead ends: 297 [2024-12-02 14:03:42,317 INFO L226 Difference]: Without dead ends: 297 [2024-12-02 14:03:42,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=330, Invalid=1926, Unknown=0, NotChecked=0, Total=2256 [2024-12-02 14:03:42,318 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 356 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:42,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1505 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 14:03:42,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-12-02 14:03:42,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 190. [2024-12-02 14:03:42,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 173 states have (on average 1.1849710982658959) internal successors, (205), 189 states have internal predecessors, (205), 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-12-02 14:03:42,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 205 transitions. [2024-12-02 14:03:42,320 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 205 transitions. Word has length 44 [2024-12-02 14:03:42,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:42,321 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 205 transitions. [2024-12-02 14:03:42,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.2777777777777777) internal successors, (118), 36 states have internal predecessors, (118), 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-12-02 14:03:42,321 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 205 transitions. [2024-12-02 14:03:42,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-12-02 14:03:42,321 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:42,321 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:03:42,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 14:03:42,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:03:42,522 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:42,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:42,522 INFO L85 PathProgramCache]: Analyzing trace with hash -484050875, now seen corresponding path program 1 times [2024-12-02 14:03:42,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:42,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800418365] [2024-12-02 14:03:42,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:42,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:42,571 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-02 14:03:42,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:42,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800418365] [2024-12-02 14:03:42,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800418365] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 14:03:42,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 14:03:42,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 14:03:42,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137153381] [2024-12-02 14:03:42,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:42,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 14:03:42,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:42,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 14:03:42,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 14:03:42,572 INFO L87 Difference]: Start difference. First operand 190 states and 205 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-12-02 14:03:42,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:42,643 INFO L93 Difference]: Finished difference Result 200 states and 213 transitions. [2024-12-02 14:03:42,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 14:03:42,644 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 47 [2024-12-02 14:03:42,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:42,644 INFO L225 Difference]: With dead ends: 200 [2024-12-02 14:03:42,644 INFO L226 Difference]: Without dead ends: 200 [2024-12-02 14:03:42,644 INFO L434 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-12-02 14:03:42,645 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 26 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:42,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 186 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 14:03:42,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-12-02 14:03:42,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 189. [2024-12-02 14:03:42,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 173 states have (on average 1.1791907514450868) internal successors, (204), 188 states have internal predecessors, (204), 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-12-02 14:03:42,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 204 transitions. [2024-12-02 14:03:42,647 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 204 transitions. Word has length 47 [2024-12-02 14:03:42,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:42,647 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 204 transitions. [2024-12-02 14:03:42,647 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-12-02 14:03:42,647 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 204 transitions. [2024-12-02 14:03:42,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-12-02 14:03:42,647 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:42,647 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 14:03:42,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-12-02 14:03:42,647 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:42,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:42,647 INFO L85 PathProgramCache]: Analyzing trace with hash -484050874, now seen corresponding path program 1 times [2024-12-02 14:03:42,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:42,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790332257] [2024-12-02 14:03:42,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:42,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:43,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:43,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790332257] [2024-12-02 14:03:43,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790332257] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:03:43,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218820705] [2024-12-02 14:03:43,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:43,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:03:43,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:03:43,122 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:03:43,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 14:03:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:43,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-12-02 14:03:43,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:03:43,363 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-12-02 14:03:43,421 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:03:43,422 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 15 treesize of output 7 [2024-12-02 14:03:43,459 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-12-02 14:03:43,518 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-12-02 14:03:43,551 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-12-02 14:03:43,667 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-12-02 14:03:43,668 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 29 treesize of output 19 [2024-12-02 14:03:43,824 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-12-02 14:03:43,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-12-02 14:03:43,933 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 23 treesize of output 15 [2024-12-02 14:03:43,935 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 26 treesize of output 14 [2024-12-02 14:03:43,938 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:43,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:03:43,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:43,997 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 31 treesize of output 35 [2024-12-02 14:03:44,211 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 8 treesize of output 4 [2024-12-02 14:03:44,240 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 40 treesize of output 36 [2024-12-02 14:03:44,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:44,472 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 87 treesize of output 91 [2024-12-02 14:03:44,481 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 52 treesize of output 50 [2024-12-02 14:03:44,493 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 150 treesize of output 144 [2024-12-02 14:03:44,517 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 20 treesize of output 16 [2024-12-02 14:03:44,520 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 20 treesize of output 16 [2024-12-02 14:03:44,651 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 42 treesize of output 38 [2024-12-02 14:03:44,835 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:44,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218820705] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 14:03:44,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 14:03:44,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 18] total 46 [2024-12-02 14:03:44,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084143561] [2024-12-02 14:03:44,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 14:03:44,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-12-02 14:03:44,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:44,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-12-02 14:03:44,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1972, Unknown=0, NotChecked=0, Total=2162 [2024-12-02 14:03:44,837 INFO L87 Difference]: Start difference. First operand 189 states and 204 transitions. Second operand has 47 states, 46 states have (on average 2.9782608695652173) internal successors, (137), 47 states have internal predecessors, (137), 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-12-02 14:03:45,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:03:45,864 INFO L93 Difference]: Finished difference Result 237 states and 259 transitions. [2024-12-02 14:03:45,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-12-02 14:03:45,864 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.9782608695652173) internal successors, (137), 47 states have internal predecessors, (137), 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-12-02 14:03:45,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:03:45,866 INFO L225 Difference]: With dead ends: 237 [2024-12-02 14:03:45,866 INFO L226 Difference]: Without dead ends: 237 [2024-12-02 14:03:45,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=517, Invalid=3643, Unknown=0, NotChecked=0, Total=4160 [2024-12-02 14:03:45,868 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 369 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 14:03:45,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1442 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 14:03:45,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-12-02 14:03:45,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 192. [2024-12-02 14:03:45,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 176 states have (on average 1.1704545454545454) internal successors, (206), 191 states have internal predecessors, (206), 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-12-02 14:03:45,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 206 transitions. [2024-12-02 14:03:45,870 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 206 transitions. Word has length 47 [2024-12-02 14:03:45,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:03:45,870 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 206 transitions. [2024-12-02 14:03:45,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.9782608695652173) internal successors, (137), 47 states have internal predecessors, (137), 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-12-02 14:03:45,870 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 206 transitions. [2024-12-02 14:03:45,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-12-02 14:03:45,871 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:03:45,871 INFO L218 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] [2024-12-02 14:03:45,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-02 14:03:46,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:03:46,071 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:03:46,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:03:46,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1867601197, now seen corresponding path program 1 times [2024-12-02 14:03:46,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:03:46,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170177047] [2024-12-02 14:03:46,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:46,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:03:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:46,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:46,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:03:46,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170177047] [2024-12-02 14:03:46,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170177047] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:03:46,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830392797] [2024-12-02 14:03:46,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:03:46,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:03:46,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:03:46,683 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:03:46,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 14:03:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:03:46,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-12-02 14:03:46,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:03:46,847 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-12-02 14:03:46,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:46,880 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 15 treesize of output 15 [2024-12-02 14:03:46,916 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 11 [2024-12-02 14:03:46,921 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-12-02 14:03:46,989 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 14:03:46,990 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-12-02 14:03:47,045 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 16 [2024-12-02 14:03:47,052 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 20 treesize of output 15 [2024-12-02 14:03:47,093 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 20 treesize of output 15 [2024-12-02 14:03:47,099 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 16 [2024-12-02 14:03:47,173 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 28 treesize of output 16 [2024-12-02 14:03:47,179 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 15 [2024-12-02 14:03:47,249 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2024-12-02 14:03:47,249 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 2 case distinctions, treesize of input 38 treesize of output 34 [2024-12-02 14:03:47,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:47,461 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 49 treesize of output 39 [2024-12-02 14:03:47,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:47,468 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 41 treesize of output 31 [2024-12-02 14:03:47,729 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 20 treesize of output 12 [2024-12-02 14:03:47,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-12-02 14:03:47,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:47,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 14:03:48,026 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 8 treesize of output 4 [2024-12-02 14:03:48,217 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|)) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (= 0 .cse0) (and (forall ((v_ArrVal_1698 (Array Int Int)) (|ULTIMATE.start_append_#t~ret15#1.offset| Int)) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_data_~data~0#1.base| v_ArrVal_1698))) (store .cse1 |c_ULTIMATE.start_append_~node~0#1.base| (store (select .cse1 |c_ULTIMATE.start_append_~node~0#1.base|) |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.offset|))) .cse0) 4) 0)) (forall ((v_ArrVal_1697 (Array Int Int)) (v_ArrVal_1699 Int)) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_data_~data~0#1.base| v_ArrVal_1697))) (store .cse2 |c_ULTIMATE.start_append_~node~0#1.base| (store (select .cse2 |c_ULTIMATE.start_append_~node~0#1.base|) |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1699))) .cse0) 4) 0))))) is different from false [2024-12-02 14:03:48,380 INFO L349 Elim1Store]: treesize reduction 39, result has 57.6 percent of original size [2024-12-02 14:03:48,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 378 treesize of output 358 [2024-12-02 14:03:48,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:48,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 159 treesize of output 159 [2024-12-02 14:03:48,399 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 182 treesize of output 176 [2024-12-02 14:03:48,420 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-12-02 14:03:48,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:48,466 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 147 treesize of output 147 [2024-12-02 14:03:48,651 INFO L349 Elim1Store]: treesize reduction 39, result has 57.6 percent of original size [2024-12-02 14:03:48,651 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 2 case distinctions, treesize of input 378 treesize of output 358 [2024-12-02 14:03:48,654 INFO L173 IndexEqualityManager]: detected equality via solver [2024-12-02 14:03:48,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:48,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 123 treesize of output 123 [2024-12-02 14:03:48,666 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 59 treesize of output 57 [2024-12-02 14:03:48,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 14:03:48,706 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 95 treesize of output 95 [2024-12-02 14:03:57,149 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 10 treesize of output 8 [2024-12-02 14:03:57,176 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 10 treesize of output 8 [2024-12-02 14:03:57,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2024-12-02 14:03:57,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:03:57,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830392797] provided 1 perfect and 1 imperfect interpolant sequences [2024-12-02 14:03:57,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-12-02 14:03:57,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [13, 18] total 39 [2024-12-02 14:03:57,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149275241] [2024-12-02 14:03:57,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 14:03:57,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-12-02 14:03:57,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 14:03:57,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-12-02 14:03:57,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1269, Unknown=3, NotChecked=72, Total=1482 [2024-12-02 14:03:57,273 INFO L87 Difference]: Start difference. First operand 192 states and 206 transitions. Second operand has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 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-12-02 14:04:11,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 14:04:11,183 INFO L93 Difference]: Finished difference Result 284 states and 303 transitions. [2024-12-02 14:04:11,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-02 14:04:11,184 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 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-12-02 14:04:11,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 14:04:11,185 INFO L225 Difference]: With dead ends: 284 [2024-12-02 14:04:11,185 INFO L226 Difference]: Without dead ends: 284 [2024-12-02 14:04:11,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=251, Invalid=2297, Unknown=6, NotChecked=98, Total=2652 [2024-12-02 14:04:11,185 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 143 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 15 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-12-02 14:04:11,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 844 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 533 Invalid, 9 Unknown, 93 Unchecked, 2.3s Time] [2024-12-02 14:04:11,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-12-02 14:04:11,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 230. [2024-12-02 14:04:11,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 214 states have (on average 1.1495327102803738) internal successors, (246), 229 states have internal predecessors, (246), 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-12-02 14:04:11,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 246 transitions. [2024-12-02 14:04:11,189 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 246 transitions. Word has length 47 [2024-12-02 14:04:11,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 14:04:11,189 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 246 transitions. [2024-12-02 14:04:11,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 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-12-02 14:04:11,189 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 246 transitions. [2024-12-02 14:04:11,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-12-02 14:04:11,190 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 14:04:11,190 INFO L218 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-12-02 14:04:11,197 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-12-02 14:04:11,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2024-12-02 14:04:11,391 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-12-02 14:04:11,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 14:04:11,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1867605069, now seen corresponding path program 1 times [2024-12-02 14:04:11,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 14:04:11,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789857162] [2024-12-02 14:04:11,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:04:11,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 14:04:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:04:17,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 14:04:17,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 14:04:17,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789857162] [2024-12-02 14:04:17,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789857162] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 14:04:17,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125781800] [2024-12-02 14:04:17,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 14:04:17,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 14:04:17,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 14:04:17,203 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 14:04:17,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ed526b6-7dc4-445a-869c-f774976859d1/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-02 14:04:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 14:04:17,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-12-02 14:04:17,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 14:04:20,051 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-12-02 14:04:20,646 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-12-02 14:04:20,646 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 15 [2024-12-02 14:04:28,386 INFO L349 Elim1Store]: treesize reduction 48, result has 74.1 percent of original size [2024-12-02 14:04:28,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 383 treesize of output 405 [2024-12-02 14:05:02,842 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse39 (select .cse6 |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse0 (not (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0))) (.cse1 (= .cse39 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0) (or .cse0 (not .cse1)) (let ((.cse20 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~#list~0#1.base|))) (.cse13 (select |c_#memory_$Pointer$#1.base| 0)) (.cse134 (store |c_ULTIMATE.start_main_old_#valid#1| .cse39 1)) (.cse9 (= |c_ULTIMATE.start_freeData_~data#1.base| 0))) (let ((.cse11 (= |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (.cse7 (not .cse9)) (.cse131 (= |c_#valid| (store .cse134 0 0))) (.cse3 (select |c_#valid| |c_ULTIMATE.start_freeData_~data#1.base|)) (.cse125 (= .cse39 |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse34 (select .cse13 |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse38 (store .cse20 .cse39 1)) (.cse76 (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse217 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse216 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse217 1))) (and (= (select .cse216 0) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse217 1) 0 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse217) (= v_DerPreprocessor_6 (select .cse216 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (.cse120 (exists ((v_prenex_6 Int)) (not (= (select .cse6 v_prenex_6) 0))))) (let ((.cse8 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse214 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse213 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse214 1)) (.cse215 (select .cse6 v_prenex_6))) (and (= (select .cse213 0) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse214 1) 0 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse214) (= v_DerPreprocessor_6 (select .cse213 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse215 0)) (not (= .cse215 .cse214))))))) (.cse21 (exists ((v_prenex_6 Int) (v_arrayElimCell_177 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse211 (select .cse6 v_prenex_6))) (let ((.cse210 (store (store .cse20 .cse211 1) v_arrayElimCell_177 (select |c_#valid| v_arrayElimCell_177)))) (let ((.cse212 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse209 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse210 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse211 1))) (and (not (= v_arrayElimCell_177 0)) (= (select .cse209 v_arrayElimCell_177) 0) (= |c_#valid| (store .cse210 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse211) 0) (not (= .cse211 0)) (not (= .cse212 0)) (not (= .cse211 .cse212)) (not (= .cse211 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse209 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))))) (.cse10 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int) (v_arrayElimCell_178 Int)) (let ((.cse206 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse207 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse206 1)) (.cse208 (select .cse6 v_prenex_6))) (and (not (= v_arrayElimCell_178 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse206) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse206 1) v_arrayElimCell_178 (select |c_#valid| v_arrayElimCell_178)) 0 0)) (= v_DerPreprocessor_6 (select .cse207 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse207 v_arrayElimCell_178) 0) (not (= .cse208 0)) (not (= .cse206 0)) (not (= .cse208 .cse206))))))) (.cse22 (exists ((v_prenex_6 Int) (v_arrayElimCell_177 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse205 (select .cse6 v_prenex_6))) (let ((.cse204 (store (store .cse20 .cse205 1) v_arrayElimCell_177 (select |c_#valid| v_arrayElimCell_177)))) (let ((.cse203 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse204 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse205 1))) (and (not (= v_arrayElimCell_177 0)) (= (select .cse203 v_arrayElimCell_177) 0) (= |c_#valid| (store .cse204 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse205) 0) (not (= .cse205 0)) (not (= .cse205 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (not (= .cse205 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse203 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))))) (.cse41 (exists ((v_prenex_6 Int)) (not (= .cse39 (select .cse6 v_prenex_6))))) (.cse124 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse202 (select .cse6 v_prenex_6))) (and (not (= .cse39 .cse202)) (not (= .cse202 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))))))) (.cse104 (and (or (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int) (v_arrayElimCell_178 Int)) (let ((.cse200 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse201 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse200 1))) (and (not (= v_arrayElimCell_178 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse200) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse200 1) v_arrayElimCell_178 (select |c_#valid| v_arrayElimCell_178)) 0 0)) (= v_DerPreprocessor_6 (select .cse201 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse201 v_arrayElimCell_178) 0) (not (= .cse200 0)))))) .cse76) .cse120)) (.cse116 (exists ((v_prenex_6 Int) (v_arrayElimCell_178 Int)) (let ((.cse199 (select .cse6 v_prenex_6))) (let ((.cse197 (store (store .cse20 .cse199 1) v_arrayElimCell_178 (select |c_#valid| v_arrayElimCell_178)))) (let ((.cse198 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse197 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse199 1))) (and (= |c_#valid| (store .cse197 0 0)) (not (= v_arrayElimCell_178 0)) (= (select .cse198 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse199) 0) (not (= .cse199 0)) (= (select .cse198 v_arrayElimCell_178) 0) (not (= .cse199 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) (.cse36 (= |c_#valid| (store .cse38 0 0))) (.cse31 (store |c_ULTIMATE.start_main_old_#valid#1| .cse34 1)) (.cse30 (not .cse125)) (.cse135 (exists ((v_prenex_7 Int)) (let ((.cse196 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_7) .cse39 1))) (and (= (select .cse196 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_7) (= (select .cse196 |c_ULTIMATE.start_freeData_~data#1.base|) 0))))) (.cse136 (or .cse131 (= |c_#valid| (store (store .cse134 |c_ULTIMATE.start_freeData_~data#1.base| .cse3) 0 0)))) (.cse42 (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse39) 0)) (.cse144 (and .cse9 .cse76)) (.cse145 (and (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse194 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse195 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse194 1))) (and (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse194) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse194 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse3) 0 0)) (= (select .cse195 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= v_DerPreprocessor_6 (select .cse195 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) .cse7)) (.cse140 (and .cse7 (exists ((v_prenex_6 Int)) (let ((.cse193 (select .cse6 v_prenex_6))) (let ((.cse191 (store (store .cse20 .cse193 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse3))) (let ((.cse192 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse191 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse193 1))) (and (= |c_#valid| (store .cse191 0 0)) (= (select .cse192 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse192 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse193) 0)))))))) (.cse50 (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (not (= (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|) 0)))) (.cse75 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int) (v_arrayElimCell_178 Int)) (let ((.cse189 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse190 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse189 1))) (and (not (= v_arrayElimCell_178 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse189) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse189 1) v_arrayElimCell_178 (select |c_#valid| v_arrayElimCell_178)) 0 0)) (= v_DerPreprocessor_6 (select .cse190 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse190 v_arrayElimCell_178) 0) (not (= .cse189 0)) (not (= (select .cse6 v_prenex_6) .cse189))))))) (.cse139 (not (= |c_ULTIMATE.start_freeData_~data#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (.cse16 (not .cse11)) (.cse83 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse188 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse187 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse188 1))) (and (= (select .cse187 0) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse188 1) 0 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse188) (= v_DerPreprocessor_6 (select .cse187 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= (select .cse6 v_prenex_6) .cse188)))))))) (or (and .cse1 (or (and (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse2 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse4 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse2 1)) (.cse5 (select .cse6 v_prenex_6))) (and (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse2) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse2 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse3) 0 0)) (= (select .cse4 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= v_DerPreprocessor_6 (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse5 0)) (not (= .cse5 .cse2)))))) .cse7) .cse8 (and .cse8 .cse9) .cse10 (and .cse11 (exists ((v_prenex_6 Int) (v_arrayElimCell_177 Int) (v_DerPreprocessor_8 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse15 (select |c_#valid| v_arrayElimCell_177)) (.cse14 (select .cse13 v_prenex_6))) (let ((.cse12 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_8) .cse14 1) v_arrayElimCell_177 .cse15) 0)) .cse14 1))) (and (= (select .cse12 0) 1) (not (= (select .cse13 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|) .cse14)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse14 1) v_arrayElimCell_177 .cse15) 0 0)) (not (= .cse14 0)) (= (select .cse12 v_arrayElimCell_177) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse14) 0)))))) (and .cse16 (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_12 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse17 (select .cse6 v_prenex_6))) (let ((.cse18 (store .cse20 .cse17 1)) (.cse19 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse17) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse18 0 v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse17 1) |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse17 0)) (not (= .cse19 0)) (= |c_#valid| (store .cse18 0 0)) (not (= .cse17 .cse19)) (not (= .cse17 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) .cse21)) (and (or .cse22 (exists ((v_prenex_6 Int) (v_DerPreprocessor_9 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse24 (select .cse6 v_prenex_6))) (let ((.cse25 (store .cse20 .cse24 1))) (let ((.cse23 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse25 0 v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse24 1))) (and (= (select .cse23 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse24) 0) (= |c_#valid| (store .cse25 0 0)) (= 0 (select .cse23 0)) (not (= .cse24 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (not (= .cse24 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) .cse16) (and (exists ((v_prenex_6 Int) (v_DerPreprocessor_11 Int) (v_arrayElimCell_177 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse29 (select |c_#valid| v_arrayElimCell_177)) (.cse28 (select .cse13 v_prenex_6))) (let ((.cse26 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_11) .cse28 1) v_arrayElimCell_177 .cse29) 0)) .cse28 1)) (.cse27 (select .cse13 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= (select .cse26 v_arrayElimCell_177) 0) (not (= .cse27 .cse28)) (= (select .cse26 0) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse28 1) v_arrayElimCell_177 .cse29) 0 0)) (not (= .cse27 0)) (not (= .cse28 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse28) 0))))) .cse11))) (and .cse0 (let ((.cse126 (or (and .cse131 (exists ((v_prenex_7 Int)) (let ((.cse132 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_7) .cse39 1))) (and (= (select .cse132 0) 0) (= (select .cse132 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_7))))) (exists ((v_prenex_7 Int) (v_arrayElimCell_175 Int)) (let ((.cse133 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_7) .cse39 1))) (and (not (= v_arrayElimCell_175 0)) (= (select .cse133 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_7) (= |c_#valid| (store (store .cse134 v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0)) (= (select .cse133 v_arrayElimCell_175) 0))))))) (let ((.cse67 (exists ((v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse130 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse129 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse130 1))) (and (= (select .cse129 v_arrayElimCell_175) 0) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse130) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse130 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0)) (= v_DerPreprocessor_6 (select .cse129 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= v_arrayElimCell_175 0))))))) (.cse35 (exists ((v_arrayElimCell_175 Int)) (let ((.cse127 (store .cse38 v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)))) (let ((.cse128 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse127 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse39 1))) (and (= |c_#valid| (store .cse127 0 0)) (= (select .cse128 v_arrayElimCell_175) 0) (not (= v_arrayElimCell_175 0)) (= (select .cse128 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) (.cse40 (and .cse125 .cse126))) (or (and (or (and .cse30 (or (and .cse11 (exists ((v_DerPreprocessor_14 Int) (v_arrayElimCell_175 Int)) (let ((.cse32 (select |c_#valid| v_arrayElimCell_175))) (let ((.cse33 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_14) .cse34 1) v_arrayElimCell_175 .cse32) 0)) .cse34 1))) (and (= |c_#valid| (store (store .cse31 v_arrayElimCell_175 .cse32) 0 0)) (= (select .cse33 0) 1) (= (select .cse33 v_arrayElimCell_175) 0)))))) (and (or .cse35 (and .cse36 (exists ((v_DerPreprocessor_15 Int)) (let ((.cse37 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse38 0 v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse39 1))) (and (= (select .cse37 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse37 0) 0)))))) .cse16))) .cse40) .cse41 .cse42) (and .cse1 (let ((.cse49 (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int)) (let ((.cse88 (select .cse6 v_prenex_6))) (let ((.cse86 (store (store .cse20 .cse88 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)))) (let ((.cse87 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse86 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse88 1))) (and (= |c_#valid| (store .cse86 0 0)) (= (select .cse87 v_arrayElimCell_175) 0) (= (select .cse87 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= v_arrayElimCell_175 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse88) 0) (not (= .cse88 |c_ULTIMATE.start_main_~#list~0#1.base|))))))))) (or (and (or (and .cse11 (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (v_DerPreprocessor_19 Int)) (let ((.cse44 (select |c_#valid| v_arrayElimCell_175)) (.cse43 (select .cse13 v_prenex_6))) (let ((.cse45 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_19) .cse43 1) v_arrayElimCell_175 .cse44) 0)) .cse43 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse43 1) v_arrayElimCell_175 .cse44) 0 0)) (= (select .cse45 v_arrayElimCell_175) 0) (= (select .cse45 0) 1) (not (= .cse43 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse43) 0)))))) (and (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_20 Int)) (let ((.cse47 (select .cse6 v_prenex_6))) (let ((.cse48 (store .cse20 .cse47 1))) (let ((.cse46 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse48 0 v_DerPreprocessor_20) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse47 1))) (and (= (select .cse46 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse46 0) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse47) 0) (= |c_#valid| (store .cse48 0 0)) (not (= .cse47 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) .cse49) .cse16)) .cse50) (and .cse16 (or (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse53 (select .cse6 v_prenex_6))) (let ((.cse51 (store (store .cse20 .cse53 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)))) (let ((.cse52 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse51 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse53 1))) (and (= |c_#valid| (store .cse51 0 0)) (= (select .cse52 v_arrayElimCell_175) 0) (= (select .cse52 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= v_arrayElimCell_175 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse53) 0) (not (= .cse53 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (not (= .cse53 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_22 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse55 (select .cse6 v_prenex_6))) (let ((.cse56 (store .cse20 .cse55 1))) (let ((.cse54 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse56 0 v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse55 1))) (and (= (select .cse54 0) 0) (= (select .cse54 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse55) 0) (= |c_#valid| (store .cse56 0 0)) (not (= .cse55 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (not (= .cse55 |c_ULTIMATE.start_main_~#list~0#1.base|))))))))) (exists ((v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse58 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse57 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse58 1))) (and (= (select .cse57 v_arrayElimCell_175) 0) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse58) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse58 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0)) (= v_DerPreprocessor_6 (select .cse57 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= v_arrayElimCell_175 0)) (not (= .cse58 0)))))) (and (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_25 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse60 (select .cse6 v_prenex_6))) (let ((.cse62 (store .cse20 .cse60 1))) (let ((.cse61 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse59 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse62 0 v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse60 1))) (and (= (select .cse59 0) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse60) 0) (not (= .cse61 0)) (= |c_#valid| (store .cse62 0 0)) (not (= .cse60 .cse61)) (= (select .cse59 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse60 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse65 (select .cse6 v_prenex_6))) (let ((.cse63 (store (store .cse20 .cse65 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)))) (let ((.cse64 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse63 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse65 1)) (.cse66 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= |c_#valid| (store .cse63 0 0)) (= (select .cse64 v_arrayElimCell_175) 0) (= (select .cse64 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= v_arrayElimCell_175 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse65) 0) (not (= .cse66 0)) (not (= .cse65 .cse66)) (not (= .cse65 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) .cse16) .cse67 (and (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_27 Int)) (let ((.cse69 (select .cse6 v_prenex_6))) (let ((.cse70 (store .cse20 .cse69 1))) (let ((.cse68 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse70 0 v_DerPreprocessor_27) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse69 1))) (and (= (select .cse68 0) 0) (= (select .cse68 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse69) 0) (= |c_#valid| (store .cse70 0 0)) (not (= .cse69 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) .cse49) .cse16) (and (exists ((v_DerPreprocessor_24 Int) (v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse73 (select |c_#valid| v_arrayElimCell_175)) (.cse72 (select .cse13 v_prenex_6))) (let ((.cse71 (select .cse13 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse74 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_24) .cse72 1) v_arrayElimCell_175 .cse73) 0)) .cse72 1))) (and (not (= .cse71 .cse72)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse72 1) v_arrayElimCell_175 .cse73) 0 0)) (not (= .cse71 0)) (= (select .cse74 0) 1) (not (= .cse72 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse72) 0) (= (select .cse74 v_arrayElimCell_175) 0))))) .cse11) .cse75 .cse76 (and .cse11 (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (v_DerPreprocessor_26 Int)) (let ((.cse79 (select |c_#valid| v_arrayElimCell_175)) (.cse78 (select .cse13 v_prenex_6))) (let ((.cse77 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_26) .cse78 1) v_arrayElimCell_175 .cse79) 0)) .cse78 1))) (and (= (select .cse77 0) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse78 1) v_arrayElimCell_175 .cse79) 0 0)) (= (select .cse77 v_arrayElimCell_175) 0) (not (= .cse78 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse78) 0)))))) (and (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_21 Int)) (let ((.cse81 (select |c_#valid| v_arrayElimCell_175)) (.cse80 (select .cse13 v_prenex_6))) (let ((.cse82 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_21) .cse80 1) v_arrayElimCell_175 .cse81) 0)) .cse80 1))) (and (not (= (select .cse13 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|) .cse80)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse80 1) v_arrayElimCell_175 .cse81) 0 0)) (= (select .cse82 v_arrayElimCell_175) 0) (not (= .cse80 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse80) 0) (= (select .cse82 0) 1))))) .cse11) .cse83 (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse85 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse84 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse85 1))) (and (= (select .cse84 v_arrayElimCell_175) 0) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse85) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse85 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0)) (= v_DerPreprocessor_6 (select .cse84 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= v_arrayElimCell_175 0)) (not (= (select .cse6 v_prenex_6) .cse85))))))))) (and (or (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse90 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse89 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse90 1)) (.cse91 (select .cse6 v_prenex_6))) (and (= (select .cse89 v_arrayElimCell_175) 0) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse90) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse90 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0)) (= v_DerPreprocessor_6 (select .cse89 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= v_arrayElimCell_175 0)) (not (= .cse91 0)) (not (= .cse91 .cse90)))))) .cse8 (and .cse11 (exists ((v_prenex_6 Int) (v_arrayElimCell_177 Int) (v_DerPreprocessor_38 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse95 (select |c_#valid| v_arrayElimCell_177)) (.cse94 (select .cse13 v_prenex_6))) (let ((.cse92 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_38) .cse94 1) v_arrayElimCell_177 .cse95) 0)) .cse94 1)) (.cse93 (select .cse13 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= 0 (select .cse92 v_arrayElimCell_177)) (= (select .cse92 0) 1) (not (= .cse93 .cse94)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse94 1) v_arrayElimCell_177 .cse95) 0 0)) (not (= .cse93 0)) (not (= .cse94 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse94) 0)))))) (and (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_39 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse97 (select .cse6 v_prenex_6))) (let ((.cse96 (store .cse20 .cse97 1)) (.cse98 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse96 0 v_DerPreprocessor_39) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse97 1) |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse97) 0) (not (= .cse97 0)) (not (= .cse98 0)) (= |c_#valid| (store .cse96 0 0)) (not (= .cse97 .cse98)) (not (= .cse97 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) .cse21) .cse16) (and (exists ((v_prenex_6 Int) (v_DerPreprocessor_34 Int) (v_arrayElimCell_177 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse101 (select |c_#valid| v_arrayElimCell_177)) (.cse100 (select .cse13 v_prenex_6))) (let ((.cse99 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_34) .cse100 1) v_arrayElimCell_177 .cse101) 0)) .cse100 1))) (and (= (select .cse99 0) 1) (not (= (select .cse13 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|) .cse100)) (= (select .cse99 v_arrayElimCell_177) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse100 1) v_arrayElimCell_177 .cse101) 0 0)) (not (= .cse100 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse100) 0))))) .cse11) .cse10 (and (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_35 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse103 (select .cse6 v_prenex_6))) (let ((.cse102 (store .cse20 .cse103 1))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse102 0 v_DerPreprocessor_35) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse103 1) |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse103) 0) (not (= .cse103 0)) (= |c_#valid| (store .cse102 0 0)) (not (= .cse103 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (not (= .cse103 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) .cse22) .cse16)) .cse1) (and (or .cse104 (and (exists ((v_prenex_6 Int) (v_DerPreprocessor_28 Int) (v_arrayElimCell_175 Int)) (let ((.cse106 (select |c_#valid| v_arrayElimCell_175)) (.cse105 (select .cse13 v_prenex_6))) (let ((.cse107 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_28) .cse105 1) v_arrayElimCell_175 .cse106) 0)) .cse105 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse105 1) v_arrayElimCell_175 .cse106) 0 0)) (= (select .cse107 v_arrayElimCell_175) 0) (= (select .cse107 0) 1) (not (= .cse105 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse105) 0))))) .cse11) (and (or (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int)) (let ((.cse110 (select .cse6 v_prenex_6))) (let ((.cse108 (store (store .cse20 .cse110 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)))) (let ((.cse109 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse108 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse110 1))) (and (= |c_#valid| (store .cse108 0 0)) (= (select .cse109 v_arrayElimCell_175) 0) (= (select .cse109 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= v_arrayElimCell_175 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse110) 0) (not (= .cse110 0)) (not (= .cse110 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_29 Int)) (let ((.cse111 (select .cse6 v_prenex_6))) (let ((.cse112 (store .cse20 .cse111 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse111) 0) (not (= .cse111 0)) (= |c_#valid| (store .cse112 0 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse112 0 v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse111 1) |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse111 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) .cse16) (and (or (and (exists ((v_prenex_6 Int) (v_arrayElimCell_178 Int) (v_DerPreprocessor_31 Int)) (let ((.cse115 (select |c_#valid| v_arrayElimCell_178)) (.cse114 (select .cse13 v_prenex_6))) (let ((.cse113 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_31) .cse114 1) v_arrayElimCell_178 .cse115) 0)) .cse114 1))) (and (= (select .cse113 v_arrayElimCell_178) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse114 1) v_arrayElimCell_178 .cse115) 0 0)) (= (select .cse113 0) 1) (not (= .cse114 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse114) 0))))) .cse11) (and .cse16 (or .cse116 (exists ((v_prenex_6 Int) (v_DerPreprocessor_32 Int)) (let ((.cse118 (select .cse6 v_prenex_6))) (let ((.cse119 (store .cse20 .cse118 1))) (let ((.cse117 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse119 0 v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse118 1))) (and (= (select .cse117 0) 0) (= (select .cse117 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse118) 0) (= |c_#valid| (store .cse119 0 0)) (not (= .cse118 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))))) .cse50) (and .cse120 (or .cse67 .cse76))) .cse1) (and (or (and (or (and .cse16 (or (and (exists ((v_DerPreprocessor_42 Int)) (let ((.cse121 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse38 0 v_DerPreprocessor_42) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse39 1))) (and (= (select .cse121 0) 0) (= (select .cse121 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))) .cse36) .cse35)) (and (exists ((v_arrayElimCell_175 Int) (v_DerPreprocessor_41 Int)) (let ((.cse123 (select |c_#valid| v_arrayElimCell_175))) (let ((.cse122 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_41) .cse34 1) v_arrayElimCell_175 .cse123) 0)) .cse34 1))) (and (= (select .cse122 0) 1) (= |c_#valid| (store (store .cse31 v_arrayElimCell_175 .cse123) 0 0)) (= (select .cse122 v_arrayElimCell_175) 0))))) .cse11)) .cse30) .cse40) .cse42) (and .cse124 .cse125 .cse126))))) (and .cse135 .cse125 .cse136 .cse41) (and .cse135 .cse124 .cse125 .cse136) (and (or .cse104 (and .cse11 .cse7 (exists ((v_prenex_6 Int) (v_DerPreprocessor_50 Int)) (let ((.cse138 (select .cse13 v_prenex_6))) (let ((.cse137 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_50) .cse138 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse3) 0)) .cse138 1))) (and (= (select .cse137 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse138 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse3) 0 0)) (= (select .cse137 0) 1) (not (= .cse138 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse138) 0)))))) (and .cse139 .cse16 (or .cse140 (and .cse9 (exists ((v_prenex_6 Int) (v_DerPreprocessor_51 Int)) (let ((.cse141 (select .cse6 v_prenex_6))) (let ((.cse142 (store .cse20 .cse141 1))) (let ((.cse143 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse142 0 v_DerPreprocessor_51) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse141 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse141) 0) (= |c_#valid| (store .cse142 0 0)) (= (select .cse143 0) 0) (not (= .cse141 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse143 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))))))) (and .cse120 (or .cse144 .cse145)) (and .cse50 (or (and (exists ((v_prenex_6 Int) (v_DerPreprocessor_47 Int) (v_arrayElimCell_178 Int)) (let ((.cse148 (select |c_#valid| v_arrayElimCell_178)) (.cse147 (select .cse13 v_prenex_6))) (let ((.cse146 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_47) .cse147 1) v_arrayElimCell_178 .cse148) 0)) .cse147 1))) (and (= (select .cse146 v_arrayElimCell_178) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse147 1) v_arrayElimCell_178 .cse148) 0 0)) (not (= .cse147 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse147) 0) (= (select .cse146 0) 1))))) .cse11) (and (or .cse116 (exists ((v_prenex_6 Int) (v_DerPreprocessor_48 Int)) (let ((.cse150 (select .cse6 v_prenex_6))) (let ((.cse151 (store .cse20 .cse150 1))) (let ((.cse149 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse151 0 v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse150 1))) (and (= (select .cse149 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse150) 0) (= (select .cse149 0) 0) (= |c_#valid| (store .cse151 0 0)) (not (= .cse150 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) .cse16)))) .cse1) (and (or (and (or (and .cse139 (or (let ((.cse152 (store .cse38 |c_ULTIMATE.start_freeData_~data#1.base| .cse3))) (let ((.cse153 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse152 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse39 1))) (and (= |c_#valid| (store .cse152 0 0)) .cse7 (= (select .cse153 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= (select .cse153 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))) (and .cse36 .cse9 (exists ((v_DerPreprocessor_46 Int)) (let ((.cse154 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse38 0 v_DerPreprocessor_46) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse39 1))) (and (= (select .cse154 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse154 0) 0)))))) .cse16) (and .cse11 (= |c_#valid| (store (store .cse31 |c_ULTIMATE.start_freeData_~data#1.base| .cse3) 0 0)) (exists ((v_DerPreprocessor_45 Int)) (let ((.cse155 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_45) .cse34 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse3) 0)) .cse34 1))) (and (= (select .cse155 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= (select .cse155 0) 1)))) .cse7)) .cse30) (and .cse135 .cse125 .cse136)) .cse42) (and (or (and .cse11 .cse7 (exists ((v_prenex_6 Int) (v_DerPreprocessor_58 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse156 (select .cse13 v_prenex_6))) (let ((.cse157 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_58) .cse156 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse3) 0)) .cse156 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse156 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse3) 0 0)) (not (= (select .cse13 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|) .cse156)) (= (select .cse157 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (not (= .cse156 0)) (= (select .cse157 0) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse156) 0)))))) (and .cse139 (or (and .cse9 (exists ((v_prenex_6 Int) (v_DerPreprocessor_57 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse159 (select .cse6 v_prenex_6))) (let ((.cse161 (store .cse20 .cse159 1))) (let ((.cse158 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse161 0 v_DerPreprocessor_57) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse159 1)) (.cse160 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= (select .cse158 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse158 0) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse159) 0) (not (= .cse160 0)) (= |c_#valid| (store .cse161 0 0)) (not (= .cse159 .cse160)) (not (= .cse159 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) (and (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse164 (select .cse6 v_prenex_6))) (let ((.cse162 (store (store .cse20 .cse164 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse3))) (let ((.cse163 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse162 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse164 1)) (.cse165 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= |c_#valid| (store .cse162 0 0)) (= (select .cse163 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse163 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse164) 0) (not (= .cse165 0)) (not (= .cse164 .cse165))))))) .cse7)) .cse16) (and .cse7 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse166 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse167 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse166 1))) (and (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse166) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse166 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse3) 0 0)) (= (select .cse167 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= v_DerPreprocessor_6 (select .cse167 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= (select .cse6 v_prenex_6) .cse166))))))) (and .cse139 .cse16 (or (and .cse9 (exists ((v_prenex_6 Int) (v_DerPreprocessor_61 Int)) (let ((.cse168 (select .cse6 v_prenex_6))) (let ((.cse170 (store .cse20 .cse168 1))) (let ((.cse169 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse170 0 v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse168 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse168) 0) (= (select .cse169 0) 0) (= |c_#valid| (store .cse170 0 0)) (not (= .cse168 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse169 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))))) .cse140)) .cse144 (and .cse11 .cse7 (exists ((v_prenex_6 Int) (v_DerPreprocessor_56 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse172 (select .cse13 v_prenex_6))) (let ((.cse173 (select .cse13 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse171 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_56) .cse172 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse3) 0)) .cse172 1))) (and (= (select .cse171 0) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse172 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse3) 0 0)) (not (= .cse173 .cse172)) (not (= .cse173 0)) (= (select .cse171 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (not (= .cse172 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse172) 0)))))) .cse145 (and (or (and .cse11 .cse7 (exists ((v_prenex_6 Int) (v_DerPreprocessor_53 Int)) (let ((.cse174 (select .cse13 v_prenex_6))) (let ((.cse175 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_53) .cse174 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse3) 0)) .cse174 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse174 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse3) 0 0)) (= (select .cse175 0) 1) (= (select .cse175 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (not (= .cse174 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse174) 0)))))) (and .cse139 .cse16 (or .cse140 (and (exists ((v_prenex_6 Int) (v_DerPreprocessor_54 Int)) (let ((.cse177 (select .cse6 v_prenex_6))) (let ((.cse178 (store .cse20 .cse177 1))) (let ((.cse176 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse178 0 v_DerPreprocessor_54) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse177 1))) (and (= (select .cse176 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse177) 0) (= |c_#valid| (store .cse178 0 0)) (not (= .cse177 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse176 0) 0)))))) .cse9)))) .cse50) (and .cse9 .cse83) .cse75 (and .cse139 (or (and .cse9 (exists ((v_prenex_6 Int) (v_DerPreprocessor_59 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse179 (select .cse6 v_prenex_6))) (let ((.cse180 (store .cse20 .cse179 1))) (let ((.cse181 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse180 0 v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse179 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse179) 0) (= |c_#valid| (store .cse180 0 0)) (not (= .cse179 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (= (select .cse181 0) 0) (not (= .cse179 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse181 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))))) (and .cse7 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse184 (select .cse6 v_prenex_6))) (let ((.cse182 (store (store .cse20 .cse184 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse3))) (let ((.cse183 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse182 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse184 1))) (and (= |c_#valid| (store .cse182 0 0)) (= (select .cse183 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse183 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse184) 0) (not (= .cse184 (select .cse6 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)))))))))) .cse16) (and (exists ((v_prenex_6 Int) (v_DerPreprocessor_60 Int)) (let ((.cse186 (select .cse13 v_prenex_6))) (let ((.cse185 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_60) .cse186 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse3) 0)) .cse186 1))) (and (= 0 (select .cse185 |c_ULTIMATE.start_freeData_~data#1.base|)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse186 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse3) 0 0)) (= (select .cse185 0) 1) (not (= .cse186 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse186) 0))))) .cse11 .cse7) .cse83) .cse1))))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base|) 0))))) is different from false [2024-12-02 14:05:13,744 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse25 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse12 (select .cse25 |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse0 (not (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0))) (.cse1 (= .cse12 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0) (or .cse0 (not .cse1)) (let ((.cse119 (= |c_ULTIMATE.start_freeData_~data#1.base| 0)) (.cse24 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~#list~0#1.base|))) (.cse20 (select |c_#memory_$Pointer$#1.base| 0))) (let ((.cse112 (store |c_ULTIMATE.start_main_old_#valid#1| .cse12 1)) (.cse106 (= .cse12 |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse7 (select .cse20 |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse3 (= |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (.cse11 (store .cse24 .cse12 1)) (.cse116 (select |c_#valid| |c_ULTIMATE.start_freeData_~data#1.base|)) (.cse118 (not .cse119)) (.cse53 (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse215 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse214 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse215 1))) (and (= (select .cse214 0) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse215 1) 0 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse215) (= v_DerPreprocessor_6 (select .cse214 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (.cse101 (exists ((v_prenex_6 Int)) (not (= (select .cse25 v_prenex_6) 0))))) (let ((.cse69 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse212 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse211 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse212 1)) (.cse213 (select .cse25 v_prenex_6))) (and (= (select .cse211 0) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse212 1) 0 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse212) (= v_DerPreprocessor_6 (select .cse211 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse213 0)) (not (= .cse213 .cse212))))))) (.cse81 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int) (v_arrayElimCell_178 Int)) (let ((.cse208 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse209 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse208 1)) (.cse210 (select .cse25 v_prenex_6))) (and (not (= v_arrayElimCell_178 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse208) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse208 1) v_arrayElimCell_178 (select |c_#valid| v_arrayElimCell_178)) 0 0)) (= v_DerPreprocessor_6 (select .cse209 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse209 v_arrayElimCell_178) 0) (not (= .cse210 0)) (not (= .cse208 0)) (not (= .cse210 .cse208))))))) (.cse77 (exists ((v_prenex_6 Int) (v_arrayElimCell_177 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse206 (select .cse25 v_prenex_6))) (let ((.cse205 (store (store .cse24 .cse206 1) v_arrayElimCell_177 (select |c_#valid| v_arrayElimCell_177)))) (let ((.cse207 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse204 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse205 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse206 1))) (and (not (= v_arrayElimCell_177 0)) (= (select .cse204 v_arrayElimCell_177) 0) (= |c_#valid| (store .cse205 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse206) 0) (not (= .cse206 0)) (not (= .cse207 0)) (not (= .cse206 .cse207)) (not (= .cse206 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse204 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))))) (.cse84 (exists ((v_prenex_6 Int) (v_arrayElimCell_177 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse203 (select .cse25 v_prenex_6))) (let ((.cse202 (store (store .cse24 .cse203 1) v_arrayElimCell_177 (select |c_#valid| v_arrayElimCell_177)))) (let ((.cse201 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse202 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse203 1))) (and (not (= v_arrayElimCell_177 0)) (= (select .cse201 v_arrayElimCell_177) 0) (= |c_#valid| (store .cse202 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse203) 0) (not (= .cse203 0)) (not (= .cse203 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (not (= .cse203 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse201 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))))) (.cse85 (and (or (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int) (v_arrayElimCell_178 Int)) (let ((.cse199 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse200 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse199 1))) (and (not (= v_arrayElimCell_178 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse199) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse199 1) v_arrayElimCell_178 (select |c_#valid| v_arrayElimCell_178)) 0 0)) (= v_DerPreprocessor_6 (select .cse200 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse200 v_arrayElimCell_178) 0) (not (= .cse199 0)))))) .cse53) .cse101)) (.cse97 (exists ((v_prenex_6 Int) (v_arrayElimCell_178 Int)) (let ((.cse198 (select .cse25 v_prenex_6))) (let ((.cse196 (store (store .cse24 .cse198 1) v_arrayElimCell_178 (select |c_#valid| v_arrayElimCell_178)))) (let ((.cse197 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse196 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse198 1))) (and (= |c_#valid| (store .cse196 0 0)) (not (= v_arrayElimCell_178 0)) (= (select .cse197 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse198) 0) (not (= .cse198 0)) (= (select .cse197 v_arrayElimCell_178) 0) (not (= .cse198 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) (.cse105 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse195 (select .cse25 v_prenex_6))) (and (not (= .cse12 .cse195)) (not (= .cse195 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))))))) (.cse15 (exists ((v_prenex_6 Int)) (not (= .cse12 (select .cse25 v_prenex_6))))) (.cse140 (and .cse119 .cse53)) (.cse141 (and (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse193 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse194 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse193 1))) (and (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse193) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse193 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse116) 0 0)) (= (select .cse194 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= v_DerPreprocessor_6 (select .cse194 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) .cse118)) (.cse136 (and .cse118 (exists ((v_prenex_6 Int)) (let ((.cse192 (select .cse25 v_prenex_6))) (let ((.cse190 (store (store .cse24 .cse192 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse116))) (let ((.cse191 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse190 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse192 1))) (and (= |c_#valid| (store .cse190 0 0)) (= (select .cse191 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse191 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse192) 0)))))))) (.cse27 (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (not (= (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|) 0)))) (.cse52 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int) (v_arrayElimCell_178 Int)) (let ((.cse188 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse189 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse188 1))) (and (not (= v_arrayElimCell_178 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse188) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse188 1) v_arrayElimCell_178 (select |c_#valid| v_arrayElimCell_178)) 0 0)) (= v_DerPreprocessor_6 (select .cse189 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse189 v_arrayElimCell_178) 0) (not (= .cse188 0)) (not (= (select .cse25 v_prenex_6) .cse188))))))) (.cse135 (not (= |c_ULTIMATE.start_freeData_~data#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (.cse60 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse187 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse186 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse187 1))) (and (= (select .cse186 0) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse187 1) 0 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse187) (= v_DerPreprocessor_6 (select .cse186 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= (select .cse25 v_prenex_6) .cse187))))))) (.cse9 (= |c_#valid| (store .cse11 0 0))) (.cse13 (not .cse3)) (.cse4 (store |c_ULTIMATE.start_main_old_#valid#1| .cse7 1)) (.cse2 (not .cse106)) (.cse148 (exists ((v_prenex_7 Int)) (let ((.cse185 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_7) .cse12 1))) (and (= (select .cse185 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_7) (= (select .cse185 |c_ULTIMATE.start_freeData_~data#1.base|) 0))))) (.cse149 (= |c_#valid| (store (store .cse112 |c_ULTIMATE.start_freeData_~data#1.base| .cse116) 0 0))) (.cse16 (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse12) 0))) (or (and .cse0 (let ((.cse107 (or (and (= |c_#valid| (store .cse112 0 0)) (exists ((v_prenex_7 Int)) (let ((.cse113 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_7) .cse12 1))) (and (= (select .cse113 0) 0) (= (select .cse113 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_7))))) (exists ((v_prenex_7 Int) (v_arrayElimCell_175 Int)) (let ((.cse114 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_7) .cse12 1))) (and (not (= v_arrayElimCell_175 0)) (= (select .cse114 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_7) (= |c_#valid| (store (store .cse112 v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0)) (= (select .cse114 v_arrayElimCell_175) 0))))))) (let ((.cse44 (exists ((v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse111 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse110 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse111 1))) (and (= (select .cse110 v_arrayElimCell_175) 0) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse111) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse111 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0)) (= v_DerPreprocessor_6 (select .cse110 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= v_arrayElimCell_175 0))))))) (.cse8 (exists ((v_arrayElimCell_175 Int)) (let ((.cse108 (store .cse11 v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)))) (let ((.cse109 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse108 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse12 1))) (and (= |c_#valid| (store .cse108 0 0)) (= (select .cse109 v_arrayElimCell_175) 0) (not (= v_arrayElimCell_175 0)) (= (select .cse109 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) (.cse14 (and .cse106 .cse107))) (or (and (or (and .cse2 (or (and .cse3 (exists ((v_DerPreprocessor_14 Int) (v_arrayElimCell_175 Int)) (let ((.cse5 (select |c_#valid| v_arrayElimCell_175))) (let ((.cse6 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_14) .cse7 1) v_arrayElimCell_175 .cse5) 0)) .cse7 1))) (and (= |c_#valid| (store (store .cse4 v_arrayElimCell_175 .cse5) 0 0)) (= (select .cse6 0) 1) (= (select .cse6 v_arrayElimCell_175) 0)))))) (and (or .cse8 (and .cse9 (exists ((v_DerPreprocessor_15 Int)) (let ((.cse10 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse11 0 v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse12 1))) (and (= (select .cse10 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse10 0) 0)))))) .cse13))) .cse14) .cse15 .cse16) (and .cse1 (let ((.cse26 (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int)) (let ((.cse65 (select .cse25 v_prenex_6))) (let ((.cse63 (store (store .cse24 .cse65 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)))) (let ((.cse64 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse63 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse65 1))) (and (= |c_#valid| (store .cse63 0 0)) (= (select .cse64 v_arrayElimCell_175) 0) (= (select .cse64 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= v_arrayElimCell_175 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse65) 0) (not (= .cse65 |c_ULTIMATE.start_main_~#list~0#1.base|))))))))) (or (and (or (and .cse3 (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (v_DerPreprocessor_19 Int)) (let ((.cse18 (select |c_#valid| v_arrayElimCell_175)) (.cse17 (select .cse20 v_prenex_6))) (let ((.cse19 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_19) .cse17 1) v_arrayElimCell_175 .cse18) 0)) .cse17 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse17 1) v_arrayElimCell_175 .cse18) 0 0)) (= (select .cse19 v_arrayElimCell_175) 0) (= (select .cse19 0) 1) (not (= .cse17 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse17) 0)))))) (and (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_20 Int)) (let ((.cse22 (select .cse25 v_prenex_6))) (let ((.cse23 (store .cse24 .cse22 1))) (let ((.cse21 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse23 0 v_DerPreprocessor_20) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse22 1))) (and (= (select .cse21 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse21 0) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse22) 0) (= |c_#valid| (store .cse23 0 0)) (not (= .cse22 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) .cse26) .cse13)) .cse27) (and .cse13 (or (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse30 (select .cse25 v_prenex_6))) (let ((.cse28 (store (store .cse24 .cse30 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)))) (let ((.cse29 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse28 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse30 1))) (and (= |c_#valid| (store .cse28 0 0)) (= (select .cse29 v_arrayElimCell_175) 0) (= (select .cse29 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= v_arrayElimCell_175 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse30) 0) (not (= .cse30 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (not (= .cse30 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_22 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse32 (select .cse25 v_prenex_6))) (let ((.cse33 (store .cse24 .cse32 1))) (let ((.cse31 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse33 0 v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse32 1))) (and (= (select .cse31 0) 0) (= (select .cse31 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse32) 0) (= |c_#valid| (store .cse33 0 0)) (not (= .cse32 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (not (= .cse32 |c_ULTIMATE.start_main_~#list~0#1.base|))))))))) (exists ((v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse35 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse34 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse35 1))) (and (= (select .cse34 v_arrayElimCell_175) 0) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse35) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse35 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0)) (= v_DerPreprocessor_6 (select .cse34 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= v_arrayElimCell_175 0)) (not (= .cse35 0)))))) (and (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_25 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse37 (select .cse25 v_prenex_6))) (let ((.cse39 (store .cse24 .cse37 1))) (let ((.cse38 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse36 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse39 0 v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse37 1))) (and (= (select .cse36 0) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse37) 0) (not (= .cse38 0)) (= |c_#valid| (store .cse39 0 0)) (not (= .cse37 .cse38)) (= (select .cse36 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse37 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse42 (select .cse25 v_prenex_6))) (let ((.cse40 (store (store .cse24 .cse42 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)))) (let ((.cse41 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse40 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse42 1)) (.cse43 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= |c_#valid| (store .cse40 0 0)) (= (select .cse41 v_arrayElimCell_175) 0) (= (select .cse41 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= v_arrayElimCell_175 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse42) 0) (not (= .cse43 0)) (not (= .cse42 .cse43)) (not (= .cse42 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) .cse13) .cse44 (and (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_27 Int)) (let ((.cse46 (select .cse25 v_prenex_6))) (let ((.cse47 (store .cse24 .cse46 1))) (let ((.cse45 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse47 0 v_DerPreprocessor_27) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse46 1))) (and (= (select .cse45 0) 0) (= (select .cse45 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse46) 0) (= |c_#valid| (store .cse47 0 0)) (not (= .cse46 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) .cse26) .cse13) (and (exists ((v_DerPreprocessor_24 Int) (v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse50 (select |c_#valid| v_arrayElimCell_175)) (.cse49 (select .cse20 v_prenex_6))) (let ((.cse48 (select .cse20 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse51 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_24) .cse49 1) v_arrayElimCell_175 .cse50) 0)) .cse49 1))) (and (not (= .cse48 .cse49)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse49 1) v_arrayElimCell_175 .cse50) 0 0)) (not (= .cse48 0)) (= (select .cse51 0) 1) (not (= .cse49 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse49) 0) (= (select .cse51 v_arrayElimCell_175) 0))))) .cse3) .cse52 .cse53 (and .cse3 (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (v_DerPreprocessor_26 Int)) (let ((.cse56 (select |c_#valid| v_arrayElimCell_175)) (.cse55 (select .cse20 v_prenex_6))) (let ((.cse54 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_26) .cse55 1) v_arrayElimCell_175 .cse56) 0)) .cse55 1))) (and (= (select .cse54 0) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse55 1) v_arrayElimCell_175 .cse56) 0 0)) (= (select .cse54 v_arrayElimCell_175) 0) (not (= .cse55 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse55) 0)))))) (and (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_21 Int)) (let ((.cse58 (select |c_#valid| v_arrayElimCell_175)) (.cse57 (select .cse20 v_prenex_6))) (let ((.cse59 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_21) .cse57 1) v_arrayElimCell_175 .cse58) 0)) .cse57 1))) (and (not (= (select .cse20 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|) .cse57)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse57 1) v_arrayElimCell_175 .cse58) 0 0)) (= (select .cse59 v_arrayElimCell_175) 0) (not (= .cse57 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse57) 0) (= (select .cse59 0) 1))))) .cse3) .cse60 (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse62 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse61 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse62 1))) (and (= (select .cse61 v_arrayElimCell_175) 0) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse62) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse62 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0)) (= v_DerPreprocessor_6 (select .cse61 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= v_arrayElimCell_175 0)) (not (= (select .cse25 v_prenex_6) .cse62))))))))) (and (or (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse67 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse66 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse67 1)) (.cse68 (select .cse25 v_prenex_6))) (and (= (select .cse66 v_arrayElimCell_175) 0) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse67) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse67 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0)) (= v_DerPreprocessor_6 (select .cse66 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= v_arrayElimCell_175 0)) (not (= .cse68 0)) (not (= .cse68 .cse67)))))) .cse69 (and .cse3 (exists ((v_prenex_6 Int) (v_arrayElimCell_177 Int) (v_DerPreprocessor_38 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse73 (select |c_#valid| v_arrayElimCell_177)) (.cse72 (select .cse20 v_prenex_6))) (let ((.cse70 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_38) .cse72 1) v_arrayElimCell_177 .cse73) 0)) .cse72 1)) (.cse71 (select .cse20 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= 0 (select .cse70 v_arrayElimCell_177)) (= (select .cse70 0) 1) (not (= .cse71 .cse72)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse72 1) v_arrayElimCell_177 .cse73) 0 0)) (not (= .cse71 0)) (not (= .cse72 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse72) 0)))))) (and (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_39 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse75 (select .cse25 v_prenex_6))) (let ((.cse74 (store .cse24 .cse75 1)) (.cse76 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse74 0 v_DerPreprocessor_39) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse75 1) |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse75) 0) (not (= .cse75 0)) (not (= .cse76 0)) (= |c_#valid| (store .cse74 0 0)) (not (= .cse75 .cse76)) (not (= .cse75 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) .cse77) .cse13) (and (exists ((v_prenex_6 Int) (v_DerPreprocessor_34 Int) (v_arrayElimCell_177 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse80 (select |c_#valid| v_arrayElimCell_177)) (.cse79 (select .cse20 v_prenex_6))) (let ((.cse78 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_34) .cse79 1) v_arrayElimCell_177 .cse80) 0)) .cse79 1))) (and (= (select .cse78 0) 1) (not (= (select .cse20 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|) .cse79)) (= (select .cse78 v_arrayElimCell_177) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse79 1) v_arrayElimCell_177 .cse80) 0 0)) (not (= .cse79 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse79) 0))))) .cse3) .cse81 (and (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_35 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse83 (select .cse25 v_prenex_6))) (let ((.cse82 (store .cse24 .cse83 1))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse82 0 v_DerPreprocessor_35) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse83 1) |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse83) 0) (not (= .cse83 0)) (= |c_#valid| (store .cse82 0 0)) (not (= .cse83 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (not (= .cse83 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) .cse84) .cse13)) .cse1) (and (or .cse85 (and (exists ((v_prenex_6 Int) (v_DerPreprocessor_28 Int) (v_arrayElimCell_175 Int)) (let ((.cse87 (select |c_#valid| v_arrayElimCell_175)) (.cse86 (select .cse20 v_prenex_6))) (let ((.cse88 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_28) .cse86 1) v_arrayElimCell_175 .cse87) 0)) .cse86 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse86 1) v_arrayElimCell_175 .cse87) 0 0)) (= (select .cse88 v_arrayElimCell_175) 0) (= (select .cse88 0) 1) (not (= .cse86 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse86) 0))))) .cse3) (and (or (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int)) (let ((.cse91 (select .cse25 v_prenex_6))) (let ((.cse89 (store (store .cse24 .cse91 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)))) (let ((.cse90 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse89 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse91 1))) (and (= |c_#valid| (store .cse89 0 0)) (= (select .cse90 v_arrayElimCell_175) 0) (= (select .cse90 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= v_arrayElimCell_175 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse91) 0) (not (= .cse91 0)) (not (= .cse91 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_29 Int)) (let ((.cse92 (select .cse25 v_prenex_6))) (let ((.cse93 (store .cse24 .cse92 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse92) 0) (not (= .cse92 0)) (= |c_#valid| (store .cse93 0 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse93 0 v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse92 1) |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse92 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) .cse13) (and (or (and (exists ((v_prenex_6 Int) (v_arrayElimCell_178 Int) (v_DerPreprocessor_31 Int)) (let ((.cse96 (select |c_#valid| v_arrayElimCell_178)) (.cse95 (select .cse20 v_prenex_6))) (let ((.cse94 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_31) .cse95 1) v_arrayElimCell_178 .cse96) 0)) .cse95 1))) (and (= (select .cse94 v_arrayElimCell_178) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse95 1) v_arrayElimCell_178 .cse96) 0 0)) (= (select .cse94 0) 1) (not (= .cse95 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse95) 0))))) .cse3) (and .cse13 (or .cse97 (exists ((v_prenex_6 Int) (v_DerPreprocessor_32 Int)) (let ((.cse99 (select .cse25 v_prenex_6))) (let ((.cse100 (store .cse24 .cse99 1))) (let ((.cse98 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse100 0 v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse99 1))) (and (= (select .cse98 0) 0) (= (select .cse98 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse99) 0) (= |c_#valid| (store .cse100 0 0)) (not (= .cse99 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))))) .cse27) (and .cse101 (or .cse44 .cse53))) .cse1) (and (or (and (or (and .cse13 (or (and (exists ((v_DerPreprocessor_42 Int)) (let ((.cse102 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse11 0 v_DerPreprocessor_42) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse12 1))) (and (= (select .cse102 0) 0) (= (select .cse102 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))) .cse9) .cse8)) (and (exists ((v_arrayElimCell_175 Int) (v_DerPreprocessor_41 Int)) (let ((.cse104 (select |c_#valid| v_arrayElimCell_175))) (let ((.cse103 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_41) .cse7 1) v_arrayElimCell_175 .cse104) 0)) .cse7 1))) (and (= (select .cse103 0) 1) (= |c_#valid| (store (store .cse4 v_arrayElimCell_175 .cse104) 0 0)) (= (select .cse103 v_arrayElimCell_175) 0))))) .cse3)) .cse2) .cse14) .cse16) (and .cse105 .cse106 .cse107))))) (and (or .cse69 (and (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse115 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse117 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse115 1))) (and (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse115) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse115 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse116) 0 0)) (= (select .cse117 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= v_DerPreprocessor_6 (select .cse117 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= (select .cse25 v_prenex_6) 0)))))) .cse118) (and .cse69 .cse119) .cse81 (and .cse3 (exists ((v_prenex_6 Int) (v_arrayElimCell_177 Int) (v_DerPreprocessor_8 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse122 (select |c_#valid| v_arrayElimCell_177)) (.cse121 (select .cse20 v_prenex_6))) (let ((.cse120 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_8) .cse121 1) v_arrayElimCell_177 .cse122) 0)) .cse121 1))) (and (= (select .cse120 0) 1) (not (= (select .cse20 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|) .cse121)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse121 1) v_arrayElimCell_177 .cse122) 0 0)) (not (= .cse121 0)) (= (select .cse120 v_arrayElimCell_177) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse121) 0)))))) (and .cse13 (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_12 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse123 (select .cse25 v_prenex_6))) (let ((.cse124 (store .cse24 .cse123 1)) (.cse125 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse123) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse124 0 v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse123 1) |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse123 0)) (not (= .cse125 0)) (= |c_#valid| (store .cse124 0 0)) (not (= .cse123 .cse125)) (not (= .cse123 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) .cse77)) (and (or .cse84 (exists ((v_prenex_6 Int) (v_DerPreprocessor_9 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse127 (select .cse25 v_prenex_6))) (let ((.cse128 (store .cse24 .cse127 1))) (let ((.cse126 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse128 0 v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse127 1))) (and (= (select .cse126 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse127) 0) (= |c_#valid| (store .cse128 0 0)) (= 0 (select .cse126 0)) (not (= .cse127 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (not (= .cse127 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) .cse13) (and (exists ((v_prenex_6 Int) (v_DerPreprocessor_11 Int) (v_arrayElimCell_177 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse132 (select |c_#valid| v_arrayElimCell_177)) (.cse131 (select .cse20 v_prenex_6))) (let ((.cse129 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_11) .cse131 1) v_arrayElimCell_177 .cse132) 0)) .cse131 1)) (.cse130 (select .cse20 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= (select .cse129 v_arrayElimCell_177) 0) (not (= .cse130 .cse131)) (= (select .cse129 0) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse131 1) v_arrayElimCell_177 .cse132) 0 0)) (not (= .cse130 0)) (not (= .cse131 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse131) 0))))) .cse3)) .cse1) (and (or .cse85 (and .cse3 .cse118 (exists ((v_prenex_6 Int) (v_DerPreprocessor_50 Int)) (let ((.cse134 (select .cse20 v_prenex_6))) (let ((.cse133 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_50) .cse134 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse116) 0)) .cse134 1))) (and (= (select .cse133 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse134 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse116) 0 0)) (= (select .cse133 0) 1) (not (= .cse134 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse134) 0)))))) (and .cse135 .cse13 (or .cse136 (and .cse119 (exists ((v_prenex_6 Int) (v_DerPreprocessor_51 Int)) (let ((.cse137 (select .cse25 v_prenex_6))) (let ((.cse138 (store .cse24 .cse137 1))) (let ((.cse139 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse138 0 v_DerPreprocessor_51) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse137 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse137) 0) (= |c_#valid| (store .cse138 0 0)) (= (select .cse139 0) 0) (not (= .cse137 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse139 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))))))) (and .cse101 (or .cse140 .cse141)) (and .cse27 (or (and (exists ((v_prenex_6 Int) (v_DerPreprocessor_47 Int) (v_arrayElimCell_178 Int)) (let ((.cse144 (select |c_#valid| v_arrayElimCell_178)) (.cse143 (select .cse20 v_prenex_6))) (let ((.cse142 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_47) .cse143 1) v_arrayElimCell_178 .cse144) 0)) .cse143 1))) (and (= (select .cse142 v_arrayElimCell_178) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse143 1) v_arrayElimCell_178 .cse144) 0 0)) (not (= .cse143 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse143) 0) (= (select .cse142 0) 1))))) .cse3) (and (or .cse97 (exists ((v_prenex_6 Int) (v_DerPreprocessor_48 Int)) (let ((.cse146 (select .cse25 v_prenex_6))) (let ((.cse147 (store .cse24 .cse146 1))) (let ((.cse145 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse147 0 v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse146 1))) (and (= (select .cse145 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse146) 0) (= (select .cse145 0) 0) (= |c_#valid| (store .cse147 0 0)) (not (= .cse146 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) .cse13)))) .cse1) (and .cse148 .cse105 .cse106 .cse149) (and .cse148 .cse106 .cse15 .cse149) (and (or (and .cse3 .cse118 (exists ((v_prenex_6 Int) (v_DerPreprocessor_58 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse150 (select .cse20 v_prenex_6))) (let ((.cse151 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_58) .cse150 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse116) 0)) .cse150 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse150 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse116) 0 0)) (not (= (select .cse20 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|) .cse150)) (= (select .cse151 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (not (= .cse150 0)) (= (select .cse151 0) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse150) 0)))))) (and .cse135 (or (and .cse119 (exists ((v_prenex_6 Int) (v_DerPreprocessor_57 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse153 (select .cse25 v_prenex_6))) (let ((.cse155 (store .cse24 .cse153 1))) (let ((.cse152 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse155 0 v_DerPreprocessor_57) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse153 1)) (.cse154 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= (select .cse152 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse152 0) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse153) 0) (not (= .cse154 0)) (= |c_#valid| (store .cse155 0 0)) (not (= .cse153 .cse154)) (not (= .cse153 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) (and (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse158 (select .cse25 v_prenex_6))) (let ((.cse156 (store (store .cse24 .cse158 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse116))) (let ((.cse157 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse156 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse158 1)) (.cse159 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= |c_#valid| (store .cse156 0 0)) (= (select .cse157 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse157 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse158) 0) (not (= .cse159 0)) (not (= .cse158 .cse159))))))) .cse118)) .cse13) (and .cse118 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse160 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse161 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse160 1))) (and (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse160) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse160 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse116) 0 0)) (= (select .cse161 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= v_DerPreprocessor_6 (select .cse161 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= (select .cse25 v_prenex_6) .cse160))))))) (and .cse135 .cse13 (or (and .cse119 (exists ((v_prenex_6 Int) (v_DerPreprocessor_61 Int)) (let ((.cse162 (select .cse25 v_prenex_6))) (let ((.cse164 (store .cse24 .cse162 1))) (let ((.cse163 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse164 0 v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse162 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse162) 0) (= (select .cse163 0) 0) (= |c_#valid| (store .cse164 0 0)) (not (= .cse162 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse163 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))))) .cse136)) .cse140 (and .cse3 .cse118 (exists ((v_prenex_6 Int) (v_DerPreprocessor_56 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse166 (select .cse20 v_prenex_6))) (let ((.cse167 (select .cse20 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse165 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_56) .cse166 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse116) 0)) .cse166 1))) (and (= (select .cse165 0) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse166 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse116) 0 0)) (not (= .cse167 .cse166)) (not (= .cse167 0)) (= (select .cse165 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (not (= .cse166 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse166) 0)))))) .cse141 (and (or (and .cse3 .cse118 (exists ((v_prenex_6 Int) (v_DerPreprocessor_53 Int)) (let ((.cse168 (select .cse20 v_prenex_6))) (let ((.cse169 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_53) .cse168 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse116) 0)) .cse168 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse168 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse116) 0 0)) (= (select .cse169 0) 1) (= (select .cse169 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (not (= .cse168 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse168) 0)))))) (and .cse135 .cse13 (or .cse136 (and (exists ((v_prenex_6 Int) (v_DerPreprocessor_54 Int)) (let ((.cse171 (select .cse25 v_prenex_6))) (let ((.cse172 (store .cse24 .cse171 1))) (let ((.cse170 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse172 0 v_DerPreprocessor_54) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse171 1))) (and (= (select .cse170 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse171) 0) (= |c_#valid| (store .cse172 0 0)) (not (= .cse171 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse170 0) 0)))))) .cse119)))) .cse27) (and .cse119 .cse60) .cse52 (and .cse135 (or (and .cse119 (exists ((v_prenex_6 Int) (v_DerPreprocessor_59 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse173 (select .cse25 v_prenex_6))) (let ((.cse174 (store .cse24 .cse173 1))) (let ((.cse175 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse174 0 v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse173 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse173) 0) (= |c_#valid| (store .cse174 0 0)) (not (= .cse173 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (= (select .cse175 0) 0) (not (= .cse173 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse175 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))))) (and .cse118 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse178 (select .cse25 v_prenex_6))) (let ((.cse176 (store (store .cse24 .cse178 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse116))) (let ((.cse177 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse176 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse178 1))) (and (= |c_#valid| (store .cse176 0 0)) (= (select .cse177 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse177 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse178) 0) (not (= .cse178 (select .cse25 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)))))))))) .cse13) (and (exists ((v_prenex_6 Int) (v_DerPreprocessor_60 Int)) (let ((.cse180 (select .cse20 v_prenex_6))) (let ((.cse179 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_60) .cse180 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse116) 0)) .cse180 1))) (and (= 0 (select .cse179 |c_ULTIMATE.start_freeData_~data#1.base|)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse180 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse116) 0 0)) (= (select .cse179 0) 1) (not (= .cse180 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse180) 0))))) .cse3 .cse118) .cse60) .cse1) (and (or (and (or (and (or (let ((.cse181 (store .cse11 |c_ULTIMATE.start_freeData_~data#1.base| .cse116))) (let ((.cse182 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse181 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse12 1))) (and (= |c_#valid| (store .cse181 0 0)) .cse118 (= (select .cse182 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= (select .cse182 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))) (and .cse9 .cse119 (exists ((v_DerPreprocessor_46 Int)) (let ((.cse183 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse11 0 v_DerPreprocessor_46) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse12 1))) (and (= (select .cse183 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse183 0) 0)))))) .cse13) (and .cse3 (= |c_#valid| (store (store .cse4 |c_ULTIMATE.start_freeData_~data#1.base| .cse116) 0 0)) (exists ((v_DerPreprocessor_45 Int)) (let ((.cse184 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_45) .cse7 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse116) 0)) .cse7 1))) (and (= (select .cse184 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= (select .cse184 0) 1)))) .cse118)) .cse2) (and .cse148 .cse106 .cse149)) .cse16))))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base|) 0))))) is different from false [2024-12-02 14:05:24,694 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse37 (select .cse15 |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse27 (not (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0))) (.cse26 (= .cse37 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0) (let ((.cse4 (= |c_ULTIMATE.start_freeData_~data#1.base| 0)) (.cse133 (select |c_#valid| |c_ULTIMATE.start_freeData_~data#1.base|)) (.cse16 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~#list~0#1.base|))) (.cse8 (select |c_#memory_$Pointer$#1.base| 0))) (let ((.cse128 (store |c_ULTIMATE.start_main_old_#valid#1| .cse37 1)) (.cse122 (= .cse37 |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse32 (select .cse8 |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse6 (= |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (.cse36 (store .cse16 .cse37 1)) (.cse1 (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse213 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse214 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse213 1))) (and (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse213) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse213 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse133) 0 0)) (= (select .cse214 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= v_DerPreprocessor_6 (select .cse214 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (.cse3 (not .cse4)) (.cse74 (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse212 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse211 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse212 1))) (and (= (select .cse211 0) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse212 1) 0 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse212) (= v_DerPreprocessor_6 (select .cse211 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (.cse2 (exists ((v_prenex_6 Int)) (not (= (select .cse15 v_prenex_6) 0))))) (let ((.cse0 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse209 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse208 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse209 1)) (.cse210 (select .cse15 v_prenex_6))) (and (= (select .cse208 0) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse209 1) 0 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse209) (= v_DerPreprocessor_6 (select .cse208 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse210 0)) (not (= .cse210 .cse209))))))) (.cse17 (exists ((v_prenex_6 Int) (v_arrayElimCell_177 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse206 (select .cse15 v_prenex_6))) (let ((.cse205 (store (store .cse16 .cse206 1) v_arrayElimCell_177 (select |c_#valid| v_arrayElimCell_177)))) (let ((.cse207 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse204 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse205 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse206 1))) (and (not (= v_arrayElimCell_177 0)) (= (select .cse204 v_arrayElimCell_177) 0) (= |c_#valid| (store .cse205 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse206) 0) (not (= .cse206 0)) (not (= .cse207 0)) (not (= .cse206 .cse207)) (not (= .cse206 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse204 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))))) (.cse5 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int) (v_arrayElimCell_178 Int)) (let ((.cse201 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse202 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse201 1)) (.cse203 (select .cse15 v_prenex_6))) (and (not (= v_arrayElimCell_178 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse201) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse201 1) v_arrayElimCell_178 (select |c_#valid| v_arrayElimCell_178)) 0 0)) (= v_DerPreprocessor_6 (select .cse202 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse202 v_arrayElimCell_178) 0) (not (= .cse203 0)) (not (= .cse201 0)) (not (= .cse203 .cse201))))))) (.cse18 (exists ((v_prenex_6 Int) (v_arrayElimCell_177 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse200 (select .cse15 v_prenex_6))) (let ((.cse199 (store (store .cse16 .cse200 1) v_arrayElimCell_177 (select |c_#valid| v_arrayElimCell_177)))) (let ((.cse198 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse199 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse200 1))) (and (not (= v_arrayElimCell_177 0)) (= (select .cse198 v_arrayElimCell_177) 0) (= |c_#valid| (store .cse199 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse200) 0) (not (= .cse200 0)) (not (= .cse200 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (not (= .cse200 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse198 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))))) (.cse102 (and (or (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int) (v_arrayElimCell_178 Int)) (let ((.cse196 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse197 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse196 1))) (and (not (= v_arrayElimCell_178 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse196) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse196 1) v_arrayElimCell_178 (select |c_#valid| v_arrayElimCell_178)) 0 0)) (= v_DerPreprocessor_6 (select .cse197 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse197 v_arrayElimCell_178) 0) (not (= .cse196 0)))))) .cse74) .cse2)) (.cse114 (exists ((v_prenex_6 Int) (v_arrayElimCell_178 Int)) (let ((.cse195 (select .cse15 v_prenex_6))) (let ((.cse193 (store (store .cse16 .cse195 1) v_arrayElimCell_178 (select |c_#valid| v_arrayElimCell_178)))) (let ((.cse194 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse193 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse195 1))) (and (= |c_#valid| (store .cse193 0 0)) (not (= v_arrayElimCell_178 0)) (= (select .cse194 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse195) 0) (not (= .cse195 0)) (= (select .cse194 v_arrayElimCell_178) 0) (not (= .cse195 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) (.cse121 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse192 (select .cse15 v_prenex_6))) (and (not (= .cse37 .cse192)) (not (= .cse192 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))))))) (.cse39 (exists ((v_prenex_6 Int)) (not (= .cse37 (select .cse15 v_prenex_6))))) (.cse139 (and .cse4 .cse74)) (.cse140 (and .cse1 .cse3)) (.cse135 (and .cse3 (exists ((v_prenex_6 Int)) (let ((.cse191 (select .cse15 v_prenex_6))) (let ((.cse189 (store (store .cse16 .cse191 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse133))) (let ((.cse190 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse189 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse191 1))) (and (= |c_#valid| (store .cse189 0 0)) (= (select .cse190 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse190 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse191) 0)))))))) (.cse48 (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (not (= (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|) 0)))) (.cse73 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int) (v_arrayElimCell_178 Int)) (let ((.cse187 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse188 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse187 1))) (and (not (= v_arrayElimCell_178 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse187) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse187 1) v_arrayElimCell_178 (select |c_#valid| v_arrayElimCell_178)) 0 0)) (= v_DerPreprocessor_6 (select .cse188 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse188 v_arrayElimCell_178) 0) (not (= .cse187 0)) (not (= (select .cse15 v_prenex_6) .cse187))))))) (.cse134 (not (= |c_ULTIMATE.start_freeData_~data#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (.cse81 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse186 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse185 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse186 1))) (and (= (select .cse185 0) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse186 1) 0 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse186) (= v_DerPreprocessor_6 (select .cse185 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= (select .cse15 v_prenex_6) .cse186))))))) (.cse34 (= |c_#valid| (store .cse36 0 0))) (.cse11 (not .cse6)) (.cse29 (store |c_ULTIMATE.start_main_old_#valid#1| .cse32 1)) (.cse28 (not .cse122)) (.cse147 (exists ((v_prenex_7 Int)) (let ((.cse184 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_7) .cse37 1))) (and (= (select .cse184 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_7) (= (select .cse184 |c_ULTIMATE.start_freeData_~data#1.base|) 0))))) (.cse148 (= |c_#valid| (store (store .cse128 |c_ULTIMATE.start_freeData_~data#1.base| .cse133) 0 0))) (.cse40 (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse37) 0))) (or (and (or .cse0 (and .cse1 .cse2 .cse3) (and .cse0 .cse4) .cse5 (and .cse6 (exists ((v_prenex_6 Int) (v_arrayElimCell_177 Int) (v_DerPreprocessor_8 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse10 (select |c_#valid| v_arrayElimCell_177)) (.cse9 (select .cse8 v_prenex_6))) (let ((.cse7 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_8) .cse9 1) v_arrayElimCell_177 .cse10) 0)) .cse9 1))) (and (= (select .cse7 0) 1) (not (= (select .cse8 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|) .cse9)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse9 1) v_arrayElimCell_177 .cse10) 0 0)) (not (= .cse9 0)) (= (select .cse7 v_arrayElimCell_177) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse9) 0)))))) (and .cse11 (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_12 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse12 (select .cse15 v_prenex_6))) (let ((.cse13 (store .cse16 .cse12 1)) (.cse14 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse12) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse13 0 v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse12 1) |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse12 0)) (not (= .cse14 0)) (= |c_#valid| (store .cse13 0 0)) (not (= .cse12 .cse14)) (not (= .cse12 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) .cse17)) (and (or .cse18 (exists ((v_prenex_6 Int) (v_DerPreprocessor_9 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse20 (select .cse15 v_prenex_6))) (let ((.cse21 (store .cse16 .cse20 1))) (let ((.cse19 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse21 0 v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse20 1))) (and (= (select .cse19 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse20) 0) (= |c_#valid| (store .cse21 0 0)) (= 0 (select .cse19 0)) (not (= .cse20 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (not (= .cse20 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) .cse11) (and (exists ((v_prenex_6 Int) (v_DerPreprocessor_11 Int) (v_arrayElimCell_177 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse25 (select |c_#valid| v_arrayElimCell_177)) (.cse24 (select .cse8 v_prenex_6))) (let ((.cse22 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_11) .cse24 1) v_arrayElimCell_177 .cse25) 0)) .cse24 1)) (.cse23 (select .cse8 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= (select .cse22 v_arrayElimCell_177) 0) (not (= .cse23 .cse24)) (= (select .cse22 0) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse24 1) v_arrayElimCell_177 .cse25) 0 0)) (not (= .cse23 0)) (not (= .cse24 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse24) 0))))) .cse6)) .cse26) (and .cse27 (let ((.cse123 (or (and (= |c_#valid| (store .cse128 0 0)) (exists ((v_prenex_7 Int)) (let ((.cse129 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_7) .cse37 1))) (and (= (select .cse129 0) 0) (= (select .cse129 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_7))))) (exists ((v_prenex_7 Int) (v_arrayElimCell_175 Int)) (let ((.cse130 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_7) .cse37 1))) (and (not (= v_arrayElimCell_175 0)) (= (select .cse130 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_7) (= |c_#valid| (store (store .cse128 v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0)) (= (select .cse130 v_arrayElimCell_175) 0))))))) (let ((.cse65 (exists ((v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse127 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse126 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse127 1))) (and (= (select .cse126 v_arrayElimCell_175) 0) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse127) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse127 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0)) (= v_DerPreprocessor_6 (select .cse126 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= v_arrayElimCell_175 0))))))) (.cse33 (exists ((v_arrayElimCell_175 Int)) (let ((.cse124 (store .cse36 v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)))) (let ((.cse125 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse124 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse37 1))) (and (= |c_#valid| (store .cse124 0 0)) (= (select .cse125 v_arrayElimCell_175) 0) (not (= v_arrayElimCell_175 0)) (= (select .cse125 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) (.cse38 (and .cse122 .cse123))) (or (and (or (and .cse28 (or (and .cse6 (exists ((v_DerPreprocessor_14 Int) (v_arrayElimCell_175 Int)) (let ((.cse30 (select |c_#valid| v_arrayElimCell_175))) (let ((.cse31 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_14) .cse32 1) v_arrayElimCell_175 .cse30) 0)) .cse32 1))) (and (= |c_#valid| (store (store .cse29 v_arrayElimCell_175 .cse30) 0 0)) (= (select .cse31 0) 1) (= (select .cse31 v_arrayElimCell_175) 0)))))) (and (or .cse33 (and .cse34 (exists ((v_DerPreprocessor_15 Int)) (let ((.cse35 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse36 0 v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse37 1))) (and (= (select .cse35 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse35 0) 0)))))) .cse11))) .cse38) .cse39 .cse40) (and .cse26 (let ((.cse47 (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int)) (let ((.cse86 (select .cse15 v_prenex_6))) (let ((.cse84 (store (store .cse16 .cse86 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)))) (let ((.cse85 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse84 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse86 1))) (and (= |c_#valid| (store .cse84 0 0)) (= (select .cse85 v_arrayElimCell_175) 0) (= (select .cse85 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= v_arrayElimCell_175 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse86) 0) (not (= .cse86 |c_ULTIMATE.start_main_~#list~0#1.base|))))))))) (or (and (or (and .cse6 (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (v_DerPreprocessor_19 Int)) (let ((.cse42 (select |c_#valid| v_arrayElimCell_175)) (.cse41 (select .cse8 v_prenex_6))) (let ((.cse43 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_19) .cse41 1) v_arrayElimCell_175 .cse42) 0)) .cse41 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse41 1) v_arrayElimCell_175 .cse42) 0 0)) (= (select .cse43 v_arrayElimCell_175) 0) (= (select .cse43 0) 1) (not (= .cse41 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse41) 0)))))) (and (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_20 Int)) (let ((.cse45 (select .cse15 v_prenex_6))) (let ((.cse46 (store .cse16 .cse45 1))) (let ((.cse44 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse46 0 v_DerPreprocessor_20) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse45 1))) (and (= (select .cse44 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse44 0) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse45) 0) (= |c_#valid| (store .cse46 0 0)) (not (= .cse45 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) .cse47) .cse11)) .cse48) (and .cse11 (or (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse51 (select .cse15 v_prenex_6))) (let ((.cse49 (store (store .cse16 .cse51 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)))) (let ((.cse50 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse49 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse51 1))) (and (= |c_#valid| (store .cse49 0 0)) (= (select .cse50 v_arrayElimCell_175) 0) (= (select .cse50 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= v_arrayElimCell_175 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse51) 0) (not (= .cse51 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (not (= .cse51 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_22 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse53 (select .cse15 v_prenex_6))) (let ((.cse54 (store .cse16 .cse53 1))) (let ((.cse52 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse54 0 v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse53 1))) (and (= (select .cse52 0) 0) (= (select .cse52 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse53) 0) (= |c_#valid| (store .cse54 0 0)) (not (= .cse53 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (not (= .cse53 |c_ULTIMATE.start_main_~#list~0#1.base|))))))))) (exists ((v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse56 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse55 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse56 1))) (and (= (select .cse55 v_arrayElimCell_175) 0) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse56) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse56 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0)) (= v_DerPreprocessor_6 (select .cse55 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= v_arrayElimCell_175 0)) (not (= .cse56 0)))))) (and (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_25 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse58 (select .cse15 v_prenex_6))) (let ((.cse60 (store .cse16 .cse58 1))) (let ((.cse59 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse57 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse60 0 v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse58 1))) (and (= (select .cse57 0) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse58) 0) (not (= .cse59 0)) (= |c_#valid| (store .cse60 0 0)) (not (= .cse58 .cse59)) (= (select .cse57 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse58 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse63 (select .cse15 v_prenex_6))) (let ((.cse61 (store (store .cse16 .cse63 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)))) (let ((.cse62 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse61 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse63 1)) (.cse64 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= |c_#valid| (store .cse61 0 0)) (= (select .cse62 v_arrayElimCell_175) 0) (= (select .cse62 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= v_arrayElimCell_175 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse63) 0) (not (= .cse64 0)) (not (= .cse63 .cse64)) (not (= .cse63 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) .cse11) .cse65 (and (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_27 Int)) (let ((.cse67 (select .cse15 v_prenex_6))) (let ((.cse68 (store .cse16 .cse67 1))) (let ((.cse66 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse68 0 v_DerPreprocessor_27) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse67 1))) (and (= (select .cse66 0) 0) (= (select .cse66 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse67) 0) (= |c_#valid| (store .cse68 0 0)) (not (= .cse67 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) .cse47) .cse11) (and (exists ((v_DerPreprocessor_24 Int) (v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse71 (select |c_#valid| v_arrayElimCell_175)) (.cse70 (select .cse8 v_prenex_6))) (let ((.cse69 (select .cse8 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse72 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_24) .cse70 1) v_arrayElimCell_175 .cse71) 0)) .cse70 1))) (and (not (= .cse69 .cse70)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse70 1) v_arrayElimCell_175 .cse71) 0 0)) (not (= .cse69 0)) (= (select .cse72 0) 1) (not (= .cse70 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse70) 0) (= (select .cse72 v_arrayElimCell_175) 0))))) .cse6) .cse73 .cse74 (and .cse6 (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (v_DerPreprocessor_26 Int)) (let ((.cse77 (select |c_#valid| v_arrayElimCell_175)) (.cse76 (select .cse8 v_prenex_6))) (let ((.cse75 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_26) .cse76 1) v_arrayElimCell_175 .cse77) 0)) .cse76 1))) (and (= (select .cse75 0) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse76 1) v_arrayElimCell_175 .cse77) 0 0)) (= (select .cse75 v_arrayElimCell_175) 0) (not (= .cse76 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse76) 0)))))) (and (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_21 Int)) (let ((.cse79 (select |c_#valid| v_arrayElimCell_175)) (.cse78 (select .cse8 v_prenex_6))) (let ((.cse80 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_21) .cse78 1) v_arrayElimCell_175 .cse79) 0)) .cse78 1))) (and (not (= (select .cse8 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|) .cse78)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse78 1) v_arrayElimCell_175 .cse79) 0 0)) (= (select .cse80 v_arrayElimCell_175) 0) (not (= .cse78 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse78) 0) (= (select .cse80 0) 1))))) .cse6) .cse81 (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse83 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse82 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse83 1))) (and (= (select .cse82 v_arrayElimCell_175) 0) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse83) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse83 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0)) (= v_DerPreprocessor_6 (select .cse82 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= v_arrayElimCell_175 0)) (not (= (select .cse15 v_prenex_6) .cse83))))))))) (and (or (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse88 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse87 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse88 1)) (.cse89 (select .cse15 v_prenex_6))) (and (= (select .cse87 v_arrayElimCell_175) 0) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse88) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse88 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0)) (= v_DerPreprocessor_6 (select .cse87 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= v_arrayElimCell_175 0)) (not (= .cse89 0)) (not (= .cse89 .cse88)))))) .cse0 (and .cse6 (exists ((v_prenex_6 Int) (v_arrayElimCell_177 Int) (v_DerPreprocessor_38 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse93 (select |c_#valid| v_arrayElimCell_177)) (.cse92 (select .cse8 v_prenex_6))) (let ((.cse90 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_38) .cse92 1) v_arrayElimCell_177 .cse93) 0)) .cse92 1)) (.cse91 (select .cse8 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= 0 (select .cse90 v_arrayElimCell_177)) (= (select .cse90 0) 1) (not (= .cse91 .cse92)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse92 1) v_arrayElimCell_177 .cse93) 0 0)) (not (= .cse91 0)) (not (= .cse92 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse92) 0)))))) (and (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_39 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse95 (select .cse15 v_prenex_6))) (let ((.cse94 (store .cse16 .cse95 1)) (.cse96 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse94 0 v_DerPreprocessor_39) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse95 1) |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse95) 0) (not (= .cse95 0)) (not (= .cse96 0)) (= |c_#valid| (store .cse94 0 0)) (not (= .cse95 .cse96)) (not (= .cse95 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) .cse17) .cse11) (and (exists ((v_prenex_6 Int) (v_DerPreprocessor_34 Int) (v_arrayElimCell_177 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse99 (select |c_#valid| v_arrayElimCell_177)) (.cse98 (select .cse8 v_prenex_6))) (let ((.cse97 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_34) .cse98 1) v_arrayElimCell_177 .cse99) 0)) .cse98 1))) (and (= (select .cse97 0) 1) (not (= (select .cse8 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|) .cse98)) (= (select .cse97 v_arrayElimCell_177) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse98 1) v_arrayElimCell_177 .cse99) 0 0)) (not (= .cse98 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse98) 0))))) .cse6) .cse5 (and (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_35 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse101 (select .cse15 v_prenex_6))) (let ((.cse100 (store .cse16 .cse101 1))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse100 0 v_DerPreprocessor_35) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse101 1) |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse101) 0) (not (= .cse101 0)) (= |c_#valid| (store .cse100 0 0)) (not (= .cse101 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (not (= .cse101 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) .cse18) .cse11)) .cse26) (and (or .cse102 (and (exists ((v_prenex_6 Int) (v_DerPreprocessor_28 Int) (v_arrayElimCell_175 Int)) (let ((.cse104 (select |c_#valid| v_arrayElimCell_175)) (.cse103 (select .cse8 v_prenex_6))) (let ((.cse105 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_28) .cse103 1) v_arrayElimCell_175 .cse104) 0)) .cse103 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse103 1) v_arrayElimCell_175 .cse104) 0 0)) (= (select .cse105 v_arrayElimCell_175) 0) (= (select .cse105 0) 1) (not (= .cse103 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse103) 0))))) .cse6) (and (or (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int)) (let ((.cse108 (select .cse15 v_prenex_6))) (let ((.cse106 (store (store .cse16 .cse108 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)))) (let ((.cse107 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse106 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse108 1))) (and (= |c_#valid| (store .cse106 0 0)) (= (select .cse107 v_arrayElimCell_175) 0) (= (select .cse107 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= v_arrayElimCell_175 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse108) 0) (not (= .cse108 0)) (not (= .cse108 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_29 Int)) (let ((.cse109 (select .cse15 v_prenex_6))) (let ((.cse110 (store .cse16 .cse109 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse109) 0) (not (= .cse109 0)) (= |c_#valid| (store .cse110 0 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse110 0 v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse109 1) |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse109 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) .cse11) (and (or (and (exists ((v_prenex_6 Int) (v_arrayElimCell_178 Int) (v_DerPreprocessor_31 Int)) (let ((.cse113 (select |c_#valid| v_arrayElimCell_178)) (.cse112 (select .cse8 v_prenex_6))) (let ((.cse111 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_31) .cse112 1) v_arrayElimCell_178 .cse113) 0)) .cse112 1))) (and (= (select .cse111 v_arrayElimCell_178) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse112 1) v_arrayElimCell_178 .cse113) 0 0)) (= (select .cse111 0) 1) (not (= .cse112 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse112) 0))))) .cse6) (and .cse11 (or .cse114 (exists ((v_prenex_6 Int) (v_DerPreprocessor_32 Int)) (let ((.cse116 (select .cse15 v_prenex_6))) (let ((.cse117 (store .cse16 .cse116 1))) (let ((.cse115 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse117 0 v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse116 1))) (and (= (select .cse115 0) 0) (= (select .cse115 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse116) 0) (= |c_#valid| (store .cse117 0 0)) (not (= .cse116 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))))) .cse48) (and .cse2 (or .cse65 .cse74))) .cse26) (and (or (and (or (and .cse11 (or (and (exists ((v_DerPreprocessor_42 Int)) (let ((.cse118 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse36 0 v_DerPreprocessor_42) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse37 1))) (and (= (select .cse118 0) 0) (= (select .cse118 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))) .cse34) .cse33)) (and (exists ((v_arrayElimCell_175 Int) (v_DerPreprocessor_41 Int)) (let ((.cse120 (select |c_#valid| v_arrayElimCell_175))) (let ((.cse119 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_41) .cse32 1) v_arrayElimCell_175 .cse120) 0)) .cse32 1))) (and (= (select .cse119 0) 1) (= |c_#valid| (store (store .cse29 v_arrayElimCell_175 .cse120) 0 0)) (= (select .cse119 v_arrayElimCell_175) 0))))) .cse6)) .cse28) .cse38) .cse40) (and .cse121 .cse122 .cse123))))) (and (or .cse102 (and .cse6 .cse3 (exists ((v_prenex_6 Int) (v_DerPreprocessor_50 Int)) (let ((.cse132 (select .cse8 v_prenex_6))) (let ((.cse131 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_50) .cse132 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse133) 0)) .cse132 1))) (and (= (select .cse131 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse132 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse133) 0 0)) (= (select .cse131 0) 1) (not (= .cse132 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse132) 0)))))) (and .cse134 .cse11 (or .cse135 (and .cse4 (exists ((v_prenex_6 Int) (v_DerPreprocessor_51 Int)) (let ((.cse136 (select .cse15 v_prenex_6))) (let ((.cse137 (store .cse16 .cse136 1))) (let ((.cse138 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse137 0 v_DerPreprocessor_51) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse136 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse136) 0) (= |c_#valid| (store .cse137 0 0)) (= (select .cse138 0) 0) (not (= .cse136 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse138 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))))))) (and .cse2 (or .cse139 .cse140)) (and .cse48 (or (and (exists ((v_prenex_6 Int) (v_DerPreprocessor_47 Int) (v_arrayElimCell_178 Int)) (let ((.cse143 (select |c_#valid| v_arrayElimCell_178)) (.cse142 (select .cse8 v_prenex_6))) (let ((.cse141 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_47) .cse142 1) v_arrayElimCell_178 .cse143) 0)) .cse142 1))) (and (= (select .cse141 v_arrayElimCell_178) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse142 1) v_arrayElimCell_178 .cse143) 0 0)) (not (= .cse142 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse142) 0) (= (select .cse141 0) 1))))) .cse6) (and (or .cse114 (exists ((v_prenex_6 Int) (v_DerPreprocessor_48 Int)) (let ((.cse145 (select .cse15 v_prenex_6))) (let ((.cse146 (store .cse16 .cse145 1))) (let ((.cse144 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse146 0 v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse145 1))) (and (= (select .cse144 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse145) 0) (= (select .cse144 0) 0) (= |c_#valid| (store .cse146 0 0)) (not (= .cse145 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) .cse11)))) .cse26) (and .cse147 .cse121 .cse122 .cse148) (and .cse147 .cse122 .cse39 .cse148) (and (or (and .cse6 .cse3 (exists ((v_prenex_6 Int) (v_DerPreprocessor_58 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse149 (select .cse8 v_prenex_6))) (let ((.cse150 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_58) .cse149 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse133) 0)) .cse149 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse149 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse133) 0 0)) (not (= (select .cse8 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|) .cse149)) (= (select .cse150 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (not (= .cse149 0)) (= (select .cse150 0) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse149) 0)))))) (and .cse134 (or (and .cse4 (exists ((v_prenex_6 Int) (v_DerPreprocessor_57 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse152 (select .cse15 v_prenex_6))) (let ((.cse154 (store .cse16 .cse152 1))) (let ((.cse151 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse154 0 v_DerPreprocessor_57) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse152 1)) (.cse153 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= (select .cse151 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse151 0) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse152) 0) (not (= .cse153 0)) (= |c_#valid| (store .cse154 0 0)) (not (= .cse152 .cse153)) (not (= .cse152 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) (and (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse157 (select .cse15 v_prenex_6))) (let ((.cse155 (store (store .cse16 .cse157 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse133))) (let ((.cse156 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse155 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse157 1)) (.cse158 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= |c_#valid| (store .cse155 0 0)) (= (select .cse156 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse156 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse157) 0) (not (= .cse158 0)) (not (= .cse157 .cse158))))))) .cse3)) .cse11) (and .cse3 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse159 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse160 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse159 1))) (and (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse159) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse159 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse133) 0 0)) (= (select .cse160 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= v_DerPreprocessor_6 (select .cse160 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= (select .cse15 v_prenex_6) .cse159))))))) (and .cse134 .cse11 (or (and .cse4 (exists ((v_prenex_6 Int) (v_DerPreprocessor_61 Int)) (let ((.cse161 (select .cse15 v_prenex_6))) (let ((.cse163 (store .cse16 .cse161 1))) (let ((.cse162 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse163 0 v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse161 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse161) 0) (= (select .cse162 0) 0) (= |c_#valid| (store .cse163 0 0)) (not (= .cse161 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse162 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))))) .cse135)) .cse139 (and .cse6 .cse3 (exists ((v_prenex_6 Int) (v_DerPreprocessor_56 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse165 (select .cse8 v_prenex_6))) (let ((.cse166 (select .cse8 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse164 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_56) .cse165 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse133) 0)) .cse165 1))) (and (= (select .cse164 0) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse165 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse133) 0 0)) (not (= .cse166 .cse165)) (not (= .cse166 0)) (= (select .cse164 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (not (= .cse165 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse165) 0)))))) .cse140 (and (or (and .cse6 .cse3 (exists ((v_prenex_6 Int) (v_DerPreprocessor_53 Int)) (let ((.cse167 (select .cse8 v_prenex_6))) (let ((.cse168 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_53) .cse167 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse133) 0)) .cse167 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse167 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse133) 0 0)) (= (select .cse168 0) 1) (= (select .cse168 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (not (= .cse167 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse167) 0)))))) (and .cse134 .cse11 (or .cse135 (and (exists ((v_prenex_6 Int) (v_DerPreprocessor_54 Int)) (let ((.cse170 (select .cse15 v_prenex_6))) (let ((.cse171 (store .cse16 .cse170 1))) (let ((.cse169 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse171 0 v_DerPreprocessor_54) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse170 1))) (and (= (select .cse169 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse170) 0) (= |c_#valid| (store .cse171 0 0)) (not (= .cse170 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse169 0) 0)))))) .cse4)))) .cse48) (and .cse4 .cse81) .cse73 (and .cse134 (or (and .cse4 (exists ((v_prenex_6 Int) (v_DerPreprocessor_59 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse172 (select .cse15 v_prenex_6))) (let ((.cse173 (store .cse16 .cse172 1))) (let ((.cse174 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse173 0 v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse172 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse172) 0) (= |c_#valid| (store .cse173 0 0)) (not (= .cse172 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (= (select .cse174 0) 0) (not (= .cse172 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse174 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))))) (and .cse3 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse177 (select .cse15 v_prenex_6))) (let ((.cse175 (store (store .cse16 .cse177 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse133))) (let ((.cse176 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse175 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse177 1))) (and (= |c_#valid| (store .cse175 0 0)) (= (select .cse176 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse176 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse177) 0) (not (= .cse177 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)))))))))) .cse11) (and (exists ((v_prenex_6 Int) (v_DerPreprocessor_60 Int)) (let ((.cse179 (select .cse8 v_prenex_6))) (let ((.cse178 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_60) .cse179 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse133) 0)) .cse179 1))) (and (= 0 (select .cse178 |c_ULTIMATE.start_freeData_~data#1.base|)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse179 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse133) 0 0)) (= (select .cse178 0) 1) (not (= .cse179 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse179) 0))))) .cse6 .cse3) .cse81) .cse26) (and (or (and (or (and (or (let ((.cse180 (store .cse36 |c_ULTIMATE.start_freeData_~data#1.base| .cse133))) (let ((.cse181 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse180 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse37 1))) (and (= |c_#valid| (store .cse180 0 0)) .cse3 (= (select .cse181 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= (select .cse181 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))) (and .cse34 .cse4 (exists ((v_DerPreprocessor_46 Int)) (let ((.cse182 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse36 0 v_DerPreprocessor_46) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse37 1))) (and (= (select .cse182 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse182 0) 0)))))) .cse11) (and .cse6 (= |c_#valid| (store (store .cse29 |c_ULTIMATE.start_freeData_~data#1.base| .cse133) 0 0)) (exists ((v_DerPreprocessor_45 Int)) (let ((.cse183 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_45) .cse32 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse133) 0)) .cse32 1))) (and (= (select .cse183 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= (select .cse183 0) 1)))) .cse3)) .cse28) (and .cse147 .cse122 .cse148)) .cse40))))) (or .cse27 (not .cse26)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base|) 0))))) is different from false [2024-12-02 14:05:43,297 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse7 (select .cse15 |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse0 (not (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0))) (.cse1 (= .cse7 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0) (or .cse0 (not .cse1)) (let ((.cse27 (select |c_#memory_$Pointer$#1.base| 0)) (.cse20 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~#list~0#1.base|)))) (let ((.cse180 (store .cse20 .cse7 1)) (.cse189 (select .cse27 |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse6 (store |c_ULTIMATE.start_main_old_#valid#1| .cse7 1)) (.cse190 (store |c_ULTIMATE.start_main_old_#valid#1| .cse189 1)) (.cse177 (store .cse180 0 0)) (.cse28 (= |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (.cse2 (= .cse7 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse10 (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse439 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse438 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse439 1))) (and (= (select .cse438 0) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse439 1) 0 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse439) (= v_DerPreprocessor_6 (select .cse438 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (.cse3 (exists ((v_prenex_6 Int)) (not (= .cse7 (select .cse15 v_prenex_6))))) (.cse116 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse437 (select .cse15 v_prenex_6))) (and (not (= .cse7 .cse437)) (not (= .cse437 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))))))) (.cse87 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse435 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse436 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse435 1))) (and (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse435) (= v_DerPreprocessor_6 (select .cse436 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse436 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse435 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= (select .cse15 v_prenex_6) .cse435))))))) (.cse101 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int) (v_arrayElimCell_178 Int)) (let ((.cse433 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse434 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse433 1))) (and (not (= v_arrayElimCell_178 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse433) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse433 1) v_arrayElimCell_178 (select |c_#valid| v_arrayElimCell_178)) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= v_DerPreprocessor_6 (select .cse434 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse434 v_arrayElimCell_178) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_178)) (not (= .cse433 0)) (not (= (select .cse15 v_prenex_6) .cse433))))))) (.cse9 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse431 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse432 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse431 1))) (and (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse431) (= v_DerPreprocessor_6 (select .cse432 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse432 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse431 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0))))))) (.cse109 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse430 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse429 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse430 1))) (and (= (select .cse429 0) 0) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse430) (= v_DerPreprocessor_6 (select .cse429 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse430 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= (select .cse15 v_prenex_6) .cse430))))))) (.cse115 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse427 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse428 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse427 1))) (and (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse427) (= v_DerPreprocessor_6 (select .cse428 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse428 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse427 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse427 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= (select .cse15 v_prenex_6) .cse427))))))) (.cse121 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse424 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse425 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse424 1)) (.cse426 (select .cse15 v_prenex_6))) (and (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse424) (= v_DerPreprocessor_6 (select .cse425 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse425 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse424 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse426 0)) (not (= .cse424 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse426 .cse424))))))) (.cse122 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse422 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse421 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse422 1)) (.cse423 (select .cse15 v_prenex_6))) (and (= (select .cse421 0) 0) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse422) (= v_DerPreprocessor_6 (select .cse421 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse422 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse423 0)) (not (= .cse423 .cse422))))))) (.cse163 (exists ((v_prenex_6 Int) (v_arrayElimCell_177 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse419 (select .cse15 v_prenex_6))) (let ((.cse418 (store (store (store .cse20 .cse419 1) v_arrayElimCell_177 (select |c_#valid| v_arrayElimCell_177)) 0 0))) (let ((.cse420 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse418 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse419 1) v_arrayElimCell_177 (select .cse418 v_arrayElimCell_177)) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse419 1))) (and (= |c_#valid| (store .cse418 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= v_arrayElimCell_177 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse419) 0) (not (= .cse419 0)) (not (= .cse419 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (not (= .cse419 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_177)) (= (select .cse420 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse420 v_arrayElimCell_177) 0))))))) (.cse147 (exists ((v_prenex_6 Int) (v_arrayElimCell_177 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse415 (select .cse15 v_prenex_6))) (let ((.cse414 (store (store (store .cse20 .cse415 1) v_arrayElimCell_177 (select |c_#valid| v_arrayElimCell_177)) 0 0))) (let ((.cse416 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse417 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse414 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse415 1) v_arrayElimCell_177 (select .cse414 v_arrayElimCell_177)) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse415 1))) (and (= |c_#valid| (store .cse414 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= v_arrayElimCell_177 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse415) 0) (not (= .cse415 0)) (not (= .cse416 0)) (not (= .cse415 .cse416)) (not (= .cse415 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_177)) (= (select .cse417 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse417 v_arrayElimCell_177) 0))))))) (.cse53 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse412 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse413 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse412 1))) (and (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse412) (= v_DerPreprocessor_6 (select .cse413 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse413 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse412 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse412 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0))))))) (.cse35 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_arrayElimCell_178 Int)) (let ((.cse411 (select .cse15 v_prenex_6))) (let ((.cse410 (store (store (store .cse20 .cse411 1) v_arrayElimCell_178 (select |c_#valid| v_arrayElimCell_178)) 0 0))) (let ((.cse409 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse410 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse411 1) v_arrayElimCell_178 (select .cse410 v_arrayElimCell_178)) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse411 1))) (and (not (= v_arrayElimCell_178 0)) (= (select .cse409 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store .cse410 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse411) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_178)) (not (= .cse411 0)) (= (select .cse409 v_arrayElimCell_178) 0) (not (= .cse411 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) (.cse49 (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (not (= (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|) 0)))) (.cse52 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse408 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse407 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse408 1))) (and (= (select .cse407 0) 0) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse408) (= v_DerPreprocessor_6 (select .cse407 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse408 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0))))))) (.cse8 (exists ((v_prenex_6 Int)) (not (= (select .cse15 v_prenex_6) 0)))) (.cse173 (not .cse2)) (.cse11 (not .cse28)) (.cse184 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse177 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse7 1)) (.cse187 (store .cse190 0 0)) (.cse4 (store .cse6 0 0)) (.cse193 (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse7) 0))) (or (and .cse2 .cse3 (exists ((v_prenex_7 Int) (v_DerPreprocessor_77 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (let ((.cse5 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_7) .cse7 1))) (and (= |c_#valid| (store .cse4 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= (select .cse5 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_7) (= v_DerPreprocessor_77 (select (store (store .cse6 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_77) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30|)) (= (select .cse5 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0))))) (and .cse1 (or (and .cse8 (or .cse9 .cse10)) (and .cse11 (or (exists ((|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (and (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| |c_ULTIMATE.start_main_~#list~0#1.base|)) (exists ((v_prenex_6 Int) (v_DerPreprocessor_157 Int) (v_DerPreprocessor_158 Int)) (let ((.cse13 (select .cse15 v_prenex_6))) (let ((.cse14 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_157) .cse13 1) |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_158) 0 0))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_main_~#list~0#1.base|))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| .cse12) .cse13 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select .cse14 |v_ULTIMATE.start_freeData_~data#1.base_30|)) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse13 1) |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= v_DerPreprocessor_157 .cse12) (= .cse13 |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse13 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0))))))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (and (exists ((v_prenex_6 Int) (v_DerPreprocessor_158 Int)) (let ((.cse16 (select .cse15 v_prenex_6))) (let ((.cse18 (store .cse20 .cse16 1))) (let ((.cse17 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse19 (store (store .cse18 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_158) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse19 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse16 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select .cse19 |v_ULTIMATE.start_freeData_~data#1.base_30|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse16 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse16) 0) (= (select .cse17 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse17 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= |c_#valid| (store (store .cse18 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse16 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| |c_ULTIMATE.start_main_~#list~0#1.base|)))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_51 Int)) (let ((.cse22 (select .cse15 v_prenex_6))) (let ((.cse23 (store (store .cse20 .cse22 1) 0 0))) (let ((.cse21 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse23 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse22 1) 0 v_DerPreprocessor_51) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse22 1))) (and (= (select .cse21 0) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse22) 0) (= (select .cse21 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| .cse23) (not (= .cse22 |c_ULTIMATE.start_main_~#list~0#1.base|))))))))) (and (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_155 Int) (v_DerPreprocessor_50 Int)) (let ((.cse26 (select .cse27 v_prenex_6))) (let ((.cse25 (store |c_ULTIMATE.start_main_old_#valid#1| .cse26 1))) (let ((.cse24 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_50) .cse26 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select (store (store .cse25 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_155) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30|)) 0)) .cse26 1))) (and (= (select .cse24 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= |c_#valid| (store (store .cse25 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse26 0)) (= (select .cse24 0) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse26) 0)))))) .cse28) (and (or (and (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_47 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_arrayElimCell_178 Int)) (let ((.cse31 (select .cse27 v_prenex_6))) (let ((.cse29 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse31 1) v_arrayElimCell_178 (select |c_#valid| v_arrayElimCell_178)) 0 0))) (let ((.cse30 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_47) .cse31 1) v_arrayElimCell_178 (select .cse29 v_arrayElimCell_178)) 0)) .cse31 1))) (and (= |c_#valid| (store .cse29 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_178)) (= (select .cse30 0) 1) (not (= .cse31 0)) (= (select .cse30 v_arrayElimCell_178) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse31) 0)))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_47 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_153 Int)) (let ((.cse34 (select .cse27 v_prenex_6))) (let ((.cse33 (store |c_ULTIMATE.start_main_old_#valid#1| .cse34 1))) (let ((.cse32 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_47) .cse34 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select (store (store .cse33 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_153) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30|)) 0)) .cse34 1))) (and (= (select .cse32 0) 1) (= |c_#valid| (store (store .cse33 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse34 0)) (= (select .cse32 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse34) 0))))))) .cse28) (and (or .cse35 (exists ((v_prenex_6 Int) (v_DerPreprocessor_151 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (let ((.cse36 (select .cse15 v_prenex_6))) (let ((.cse37 (store .cse20 .cse36 1))) (let ((.cse38 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse39 (store (store .cse37 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_151) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse39 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse36 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select .cse39 |v_ULTIMATE.start_freeData_~data#1.base_30|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse36 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse36) 0) (not (= .cse36 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= |c_#valid| (store (store .cse37 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse36 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse38 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= (select .cse38 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_152 Int) (v_DerPreprocessor_48 Int)) (let ((.cse41 (select .cse15 v_prenex_6))) (let ((.cse40 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_152) .cse41 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse41 1) 0 v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse41 1))) (and (= (select .cse40 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse40 0) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse41) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse41 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= .cse41 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_48 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (let ((.cse43 (select .cse15 v_prenex_6))) (let ((.cse44 (store (store .cse20 .cse43 1) 0 0))) (let ((.cse42 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse44 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse43 1) 0 v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse43 1))) (and (= (select .cse42 0) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse43) 0) (= |c_#valid| (store .cse44 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse43 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse42 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_150 Int) (v_arrayElimCell_178 Int)) (let ((.cse47 (select |c_#valid| v_arrayElimCell_178)) (.cse46 (select .cse15 v_prenex_6))) (let ((.cse45 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse48 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_150) .cse46 1) v_arrayElimCell_178 .cse47) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse48 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse46 1) v_arrayElimCell_178 (select .cse48 v_arrayElimCell_178))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse46 1))) (and (= (select .cse45 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= v_arrayElimCell_178 0)) (= (select .cse45 v_arrayElimCell_178) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse46) 0) (not (= .cse46 0)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse46 1) v_arrayElimCell_178 .cse47) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= .cse46 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) .cse11)) .cse49) (and .cse8 (or (exists ((|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int) (v_arrayElimCell_178 Int)) (let ((.cse50 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse51 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse50 1))) (and (not (= v_arrayElimCell_178 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse50) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse50 1) v_arrayElimCell_178 (select |c_#valid| v_arrayElimCell_178)) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= v_DerPreprocessor_6 (select .cse51 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse51 v_arrayElimCell_178) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_178)) (not (= .cse50 0)))))) .cse52 .cse53)))) (and (or (and (or (and .cse28 (exists ((v_prenex_6 Int) (v_DerPreprocessor_129 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_53 Int)) (let ((.cse56 (select .cse27 v_prenex_6))) (let ((.cse55 (store |c_ULTIMATE.start_main_old_#valid#1| .cse56 1))) (let ((.cse54 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_53) .cse56 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select (store (store .cse55 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_129) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30|)) 0)) .cse56 1))) (and (= (select .cse54 0) 1) (= (select .cse54 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= |c_#valid| (store (store .cse55 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse56 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse56) 0))))))) (and .cse11 (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_54 Int)) (let ((.cse58 (select .cse15 v_prenex_6))) (let ((.cse59 (store (store .cse20 .cse58 1) 0 0))) (let ((.cse57 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse59 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse58 1) 0 v_DerPreprocessor_54) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse58 1))) (and (= (select .cse57 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse58) 0) (= |c_#valid| .cse59) (not (= .cse58 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse57 0) 0)))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (and (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| |c_ULTIMATE.start_main_~#list~0#1.base|)) (exists ((v_prenex_6 Int) (v_DerPreprocessor_131 Int) (v_DerPreprocessor_132 Int)) (let ((.cse61 (select .cse15 v_prenex_6))) (let ((.cse62 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_131) .cse61 1) |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_132) 0 0))) (let ((.cse60 (select .cse62 |c_ULTIMATE.start_main_~#list~0#1.base|))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| .cse60) .cse61 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select .cse62 |v_ULTIMATE.start_freeData_~data#1.base_30|)) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse61 1) |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= .cse60 v_DerPreprocessor_131) (= .cse61 |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse61 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0))))))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (and (exists ((v_prenex_6 Int) (v_DerPreprocessor_132 Int)) (let ((.cse63 (select .cse15 v_prenex_6))) (let ((.cse65 (store .cse20 .cse63 1))) (let ((.cse64 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse66 (store (store .cse65 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_132) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse66 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse63 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select .cse66 |v_ULTIMATE.start_freeData_~data#1.base_30|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse63 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse63) 0) (= (select .cse64 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse64 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= |c_#valid| (store (store .cse65 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse63 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| |c_ULTIMATE.start_main_~#list~0#1.base|))))))) .cse49) (and (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_59 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse67 (select .cse15 v_prenex_6))) (let ((.cse68 (store (store .cse20 .cse67 1) 0 0))) (let ((.cse69 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse68 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse67 1) 0 v_DerPreprocessor_59) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse67 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse67) 0) (= |c_#valid| .cse68) (= (select .cse69 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse67 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (not (= .cse67 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse69 0) 0)))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (and (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_136 Int) (v_DerPreprocessor_137 Int)) (let ((.cse71 (select .cse15 v_prenex_6))) (let ((.cse72 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_136) .cse71 1) |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_137) 0 0))) (let ((.cse70 (select .cse72 |c_ULTIMATE.start_main_~#list~0#1.base|))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| .cse70) .cse71 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select .cse72 |v_ULTIMATE.start_freeData_~data#1.base_30|)) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse71 1) |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= .cse71 |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse71 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse71 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (= .cse70 v_DerPreprocessor_136)))))) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| |c_ULTIMATE.start_main_~#list~0#1.base|)))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (and (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_137 Int)) (let ((.cse74 (select .cse15 v_prenex_6))) (let ((.cse75 (store .cse20 .cse74 1))) (let ((.cse73 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse76 (store (store .cse75 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_137) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse76 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse74 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select .cse76 |v_ULTIMATE.start_freeData_~data#1.base_30|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse74 1))) (and (= (select .cse73 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse74) 0) (not (= .cse74 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (= |c_#valid| (store (store .cse75 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse74 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse73 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0)))))) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| |c_ULTIMATE.start_main_~#list~0#1.base|))))) .cse11) (and (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_61 Int)) (let ((.cse78 (select .cse15 v_prenex_6))) (let ((.cse79 (store (store .cse20 .cse78 1) 0 0))) (let ((.cse77 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse79 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse78 1) 0 v_DerPreprocessor_61) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse78 1))) (and (= (select .cse77 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse78) 0) (= |c_#valid| .cse79) (= (select .cse77 0) 0) (not (= .cse78 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (and (exists ((v_prenex_6 Int) (v_DerPreprocessor_143 Int) (v_DerPreprocessor_144 Int)) (let ((.cse80 (select .cse15 v_prenex_6))) (let ((.cse82 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_143) .cse80 1) |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_144) 0 0))) (let ((.cse81 (select .cse82 |c_ULTIMATE.start_main_~#list~0#1.base|))) (and (= .cse80 |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| .cse81) .cse80 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select .cse82 |v_ULTIMATE.start_freeData_~data#1.base_30|)) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse80 1) |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse80 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= v_DerPreprocessor_143 .cse81)))))) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| |c_ULTIMATE.start_main_~#list~0#1.base|)))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (and (exists ((v_prenex_6 Int) (v_DerPreprocessor_144 Int)) (let ((.cse84 (select .cse15 v_prenex_6))) (let ((.cse85 (store .cse20 .cse84 1))) (let ((.cse83 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse86 (store (store .cse85 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_144) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse86 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse84 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select .cse86 |v_ULTIMATE.start_freeData_~data#1.base_30|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse84 1))) (and (= (select .cse83 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= (select .cse83 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse84) 0) (= |c_#valid| (store (store .cse85 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse84 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| |c_ULTIMATE.start_main_~#list~0#1.base|))))) .cse11) .cse87 (and (or (exists ((|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (and (exists ((v_prenex_6 Int) (v_DerPreprocessor_140 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_139 Int)) (let ((.cse89 (select .cse15 v_prenex_6))) (let ((.cse90 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_139) .cse89 1) |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_140) 0 0))) (let ((.cse91 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse88 (select .cse90 |c_ULTIMATE.start_main_~#list~0#1.base|))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| .cse88) .cse89 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select .cse90 |v_ULTIMATE.start_freeData_~data#1.base_30|)) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse89 1) |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= .cse89 |c_ULTIMATE.start_main_~#list~0#1.base|) (not (= .cse91 0)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse89 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse89 .cse91)) (= v_DerPreprocessor_139 .cse88)))))) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| |c_ULTIMATE.start_main_~#list~0#1.base|)))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (and (exists ((v_prenex_6 Int) (v_DerPreprocessor_140 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse93 (select .cse15 v_prenex_6))) (let ((.cse95 (store .cse20 .cse93 1))) (let ((.cse94 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse92 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse96 (store (store .cse95 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_140) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse96 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse93 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select .cse96 |v_ULTIMATE.start_freeData_~data#1.base_30|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse93 1))) (and (= (select .cse92 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse93) 0) (not (= .cse94 0)) (not (= .cse93 .cse94)) (= |c_#valid| (store (store .cse95 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse93 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse92 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| |c_ULTIMATE.start_main_~#list~0#1.base|)))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_57 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse98 (select .cse15 v_prenex_6))) (let ((.cse100 (store (store .cse20 .cse98 1) 0 0))) (let ((.cse97 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse100 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse98 1) 0 v_DerPreprocessor_57) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse98 1)) (.cse99 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= (select .cse97 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse98) 0) (not (= .cse99 0)) (= (select .cse97 0) 0) (= |c_#valid| .cse100) (not (= .cse98 .cse99)) (not (= .cse98 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) .cse11) .cse101 (and .cse28 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_60 Int) (v_DerPreprocessor_133 Int)) (let ((.cse104 (select .cse27 v_prenex_6))) (let ((.cse103 (store |c_ULTIMATE.start_main_old_#valid#1| .cse104 1))) (let ((.cse102 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_60) .cse104 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select (store (store .cse103 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_133) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30|)) 0)) .cse104 1))) (and (= (select .cse102 0) 1) (= (select .cse102 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= |c_#valid| (store (store .cse103 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse104 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse104) 0))))))) (and (exists ((v_prenex_6 Int) (v_DerPreprocessor_56 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_145 Int)) (let ((.cse107 (select .cse27 v_prenex_6))) (let ((.cse108 (store |c_ULTIMATE.start_main_old_#valid#1| .cse107 1))) (let ((.cse105 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_56) .cse107 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select (store (store .cse108 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_145) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30|)) 0)) .cse107 1)) (.cse106 (select .cse27 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= (select .cse105 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= (select .cse105 0) 1) (not (= .cse106 .cse107)) (not (= .cse106 0)) (= |c_#valid| (store (store .cse108 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse107 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse107) 0)))))) .cse28) .cse9 .cse109 .cse10 (and .cse28 (exists ((v_prenex_6 Int) (v_DerPreprocessor_58 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_134 Int)) (let ((.cse110 (select .cse27 v_prenex_6))) (let ((.cse111 (store |c_ULTIMATE.start_main_old_#valid#1| .cse110 1))) (let ((.cse112 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_58) .cse110 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select (store (store .cse111 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_134) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30|)) 0)) .cse110 1))) (and (not (= (select .cse27 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|) .cse110)) (= |c_#valid| (store (store .cse111 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= (select .cse112 0) 1) (= (select .cse112 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (not (= .cse110 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse110) 0))))))) (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse114 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse113 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse114 1))) (and (= (select .cse113 0) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse114 1) 0 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse114) (= v_DerPreprocessor_6 (select .cse113 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= (select .cse15 v_prenex_6) .cse114)))))) .cse115) .cse1) (and .cse116 .cse2 (exists ((v_prenex_7 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_148 Int)) (let ((.cse117 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_7) .cse7 1))) (and (= v_DerPreprocessor_148 (select (store (store .cse6 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_148) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30|)) (= |c_#valid| (store .cse4 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= (select .cse117 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_7) (= (select .cse117 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0))))) (and .cse1 (or (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse119 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse118 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse119 1)) (.cse120 (select .cse15 v_prenex_6))) (and (= (select .cse118 0) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse119 1) 0 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse119) (= v_DerPreprocessor_6 (select .cse118 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse120 0)) (not (= .cse120 .cse119)))))) .cse121 .cse122 (and .cse28 (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_11 Int) (v_arrayElimCell_177 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse125 (select .cse27 v_prenex_6))) (let ((.cse126 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse125 1) v_arrayElimCell_177 (select |c_#valid| v_arrayElimCell_177)) 0 0))) (let ((.cse124 (select .cse27 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse123 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_11) .cse125 1) v_arrayElimCell_177 (select .cse126 v_arrayElimCell_177)) 0)) .cse125 1))) (and (= (select .cse123 0) 1) (not (= .cse124 .cse125)) (not (= .cse124 0)) (= |c_#valid| (store .cse126 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= (select .cse123 v_arrayElimCell_177) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_177)) (not (= .cse125 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse125) 0)))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_11 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_71 Int)) (let ((.cse129 (select .cse27 v_prenex_6))) (let ((.cse130 (store |c_ULTIMATE.start_main_old_#valid#1| .cse129 1))) (let ((.cse127 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_11) .cse129 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select (store (store .cse130 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_71) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30|)) 0)) .cse129 1)) (.cse128 (select .cse27 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= (select .cse127 0) 1) (not (= .cse128 .cse129)) (= (select .cse127 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (not (= .cse128 0)) (= |c_#valid| (store (store .cse130 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse129 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse129) 0)))))))) (and .cse28 (or (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_8 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_70 Int)) (let ((.cse132 (select .cse27 v_prenex_6))) (let ((.cse133 (store |c_ULTIMATE.start_main_old_#valid#1| .cse132 1))) (let ((.cse131 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_8) .cse132 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select (store (store .cse133 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_70) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30|)) 0)) .cse132 1))) (and (= (select .cse131 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= (select .cse131 0) 1) (not (= (select .cse27 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|) .cse132)) (= |c_#valid| (store (store .cse133 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse132 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse132) 0)))))) (exists ((v_prenex_6 Int) (v_arrayElimCell_177 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_8 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse135 (select .cse27 v_prenex_6))) (let ((.cse136 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse135 1) v_arrayElimCell_177 (select |c_#valid| v_arrayElimCell_177)) 0 0))) (let ((.cse134 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_8) .cse135 1) v_arrayElimCell_177 (select .cse136 v_arrayElimCell_177)) 0)) .cse135 1))) (and (= (select .cse134 v_arrayElimCell_177) 0) (not (= (select .cse27 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|) .cse135)) (= |c_#valid| (store .cse136 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_177)) (not (= .cse135 0)) (= (select .cse134 0) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse135) 0)))))))) (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_arrayElimCell_178 Int) (v_DerPreprocessor_6 Int)) (let ((.cse137 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse138 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse137 1)) (.cse139 (select .cse15 v_prenex_6))) (and (not (= v_arrayElimCell_178 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse137) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse137 1) v_arrayElimCell_178 (select |c_#valid| v_arrayElimCell_178)) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= v_DerPreprocessor_6 (select .cse138 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse138 v_arrayElimCell_178) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_178)) (not (= .cse139 0)) (not (= .cse137 0)) (not (= .cse139 .cse137)))))) (and .cse11 (or (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_73 Int)) (let ((.cse141 (select .cse15 v_prenex_6))) (let ((.cse143 (store .cse20 .cse141 1))) (let ((.cse140 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse144 (store (store .cse143 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_73) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse144 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse141 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select .cse144 |v_ULTIMATE.start_freeData_~data#1.base_30|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse141 1)) (.cse142 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= (select .cse140 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= (select .cse140 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse141) 0) (not (= .cse141 0)) (not (= .cse142 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse141 .cse142)) (= |c_#valid| (store (store .cse143 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse141 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_12 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_74 Int)) (let ((.cse146 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse145 (select .cse15 v_prenex_6))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_74) .cse145 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse145 1) 0 v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse145 1) |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse145) 0) (not (= .cse145 0)) (not (= .cse146 0)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse145 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= .cse145 .cse146)) (not (= .cse145 |c_ULTIMATE.start_main_~#list~0#1.base|))))) .cse147 (exists ((v_prenex_6 Int) (v_arrayElimCell_177 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_72 Int)) (let ((.cse149 (select |c_#valid| v_arrayElimCell_177)) (.cse148 (select .cse15 v_prenex_6))) (let ((.cse150 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse152 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_72) .cse148 1) v_arrayElimCell_177 .cse149) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse152 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse148 1) v_arrayElimCell_177 (select .cse152 v_arrayElimCell_177))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse148 1)) (.cse151 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse148 1) v_arrayElimCell_177 .cse149) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= v_arrayElimCell_177 0)) (= (select .cse150 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse148) 0) (not (= .cse148 0)) (not (= .cse151 0)) (= (select .cse150 v_arrayElimCell_177) 0) (not (= .cse148 .cse151)) (not (= .cse148 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_12 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse154 (select .cse15 v_prenex_6))) (let ((.cse155 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse153 (store (store .cse20 .cse154 1) 0 0))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse153 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse154 1) 0 v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse154 1) |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse154) 0) (not (= .cse154 0)) (not (= .cse155 0)) (not (= .cse154 .cse155)) (= |c_#valid| (store .cse153 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse154 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) (and .cse8 .cse9) (and (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_68 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse157 (select .cse15 v_prenex_6))) (let ((.cse158 (store .cse20 .cse157 1))) (let ((.cse156 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse159 (store (store .cse158 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_68) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse159 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse157 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select .cse159 |v_ULTIMATE.start_freeData_~data#1.base_30|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse157 1))) (and (= (select .cse156 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= (select .cse156 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse157) 0) (not (= .cse157 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse157 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (= |c_#valid| (store (store .cse158 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse157 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_9 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse161 (select .cse15 v_prenex_6))) (let ((.cse162 (store (store .cse20 .cse161 1) 0 0))) (let ((.cse160 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse162 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse161 1) 0 v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse161 1))) (and (= (select .cse160 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse161) 0) (not (= .cse161 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (= (select .cse160 0) 0) (= |c_#valid| (store .cse162 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse161 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) .cse163 (exists ((v_prenex_6 Int) (v_DerPreprocessor_69 Int) (v_DerPreprocessor_9 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse164 (select .cse15 v_prenex_6))) (let ((.cse165 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_69) .cse164 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse164 1) 0 v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse164 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse164) 0) (= (select .cse165 0) 0) (= (select .cse165 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse164 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= .cse164 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (not (= .cse164 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_67 Int) (v_arrayElimCell_177 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse167 (select |c_#valid| v_arrayElimCell_177)) (.cse166 (select .cse15 v_prenex_6))) (let ((.cse168 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse169 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_67) .cse166 1) v_arrayElimCell_177 .cse167) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse169 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse166 1) v_arrayElimCell_177 (select .cse169 v_arrayElimCell_177))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse166 1))) (and (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse166 1) v_arrayElimCell_177 .cse167) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= v_arrayElimCell_177 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse166) 0) (not (= .cse166 0)) (not (= .cse166 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (not (= .cse166 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse168 v_arrayElimCell_177) 0) (= (select .cse168 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) .cse11))) (and .cse0 (let ((.cse170 (and (exists ((|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (= |c_#valid| (store .cse4 |v_ULTIMATE.start_freeData_~data#1.base_30| 0))) (exists ((v_prenex_7 Int)) (let ((.cse401 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_7) .cse7 1))) (and (= (select .cse401 0) 0) (= (select .cse401 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_7)))))) (.cse171 (exists ((v_prenex_7 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (let ((.cse400 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_7) .cse7 1))) (and (= |c_#valid| (store (store (store .cse6 v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= v_arrayElimCell_175 0)) (= (select .cse400 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_7) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_175)) (= (select .cse400 v_arrayElimCell_175) 0)))))) (let ((.cse227 (exists ((v_arrayElimCell_175 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse399 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse398 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse399 1))) (and (= (select .cse398 v_arrayElimCell_175) 0) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse399) (= v_DerPreprocessor_6 (select .cse398 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= v_arrayElimCell_175 0)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse399 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_175))))))) (.cse194 (or (exists ((v_prenex_7 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (let ((.cse397 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_7) .cse7 1))) (and (= |c_#valid| (store .cse4 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= (select .cse397 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_7) (= (select .cse397 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0)))) .cse170 .cse171)) (.cse185 (= |c_#valid| (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.base| 0))) (.cse181 (exists ((v_arrayElimCell_175 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (let ((.cse395 (store (store .cse180 v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0))) (let ((.cse396 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse395 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse7 1) v_arrayElimCell_175 (select .cse395 v_arrayElimCell_175)) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse7 1))) (and (= |c_#valid| (store .cse395 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= (select .cse396 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= v_arrayElimCell_175 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_175)) (= (select .cse396 v_arrayElimCell_175) 0)))))) (.cse182 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (and (= |c_#valid| (store .cse177 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (or (and .cse3 (or (and .cse2 (or .cse170 .cse171 (exists ((v_prenex_7 Int) (v_arrayElimCell_175 Int)) (let ((.cse172 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_7) .cse7 1))) (and (= |c_#valid| (store .cse4 v_arrayElimCell_175 0)) (not (= v_arrayElimCell_175 0)) (= (select .cse172 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_7) (= (select .cse172 v_arrayElimCell_175) 0)))))) (and .cse173 (or (and (or (exists ((v_arrayElimCell_175 Int) (v_DerPreprocessor_106 Int)) (let ((.cse175 (select |c_#valid| v_arrayElimCell_175))) (let ((.cse174 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse176 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_106) .cse7 1) v_arrayElimCell_175 .cse175) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse176 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse7 1) v_arrayElimCell_175 (select .cse176 v_arrayElimCell_175))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse7 1))) (and (= (select .cse174 v_arrayElimCell_175) 0) (not (= v_arrayElimCell_175 0)) (= |c_#valid| (store (store (store .cse6 v_arrayElimCell_175 .cse175) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select .cse174 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))) (exists ((v_DerPreprocessor_107 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (let ((.cse178 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse179 (store (store .cse180 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_107) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse179 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse7 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select .cse179 |v_ULTIMATE.start_freeData_~data#1.base_30|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse7 1))) (and (= |c_#valid| (store .cse177 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= (select .cse178 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= (select .cse178 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0)))) .cse181 (and .cse182 (exists ((v_DerPreprocessor_15 Int)) (let ((.cse183 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse184 0 v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse7 1))) (and (= (select .cse183 0) 0) (= (select .cse183 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))) (and .cse185 (exists ((v_DerPreprocessor_15 Int) (v_DerPreprocessor_105 Int)) (let ((.cse186 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_105) .cse7 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse7 1) 0 v_DerPreprocessor_15) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse7 1))) (and (= (select .cse186 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse186 0) 0)))))) .cse11) (and (or (exists ((v_DerPreprocessor_108 Int) (v_DerPreprocessor_14 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (let ((.cse188 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_14) .cse189 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select (store (store .cse190 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_108) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30|)) 0)) .cse189 1))) (and (= |c_#valid| (store .cse187 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= (select .cse188 0) 1) (= (select .cse188 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0)))) (exists ((v_DerPreprocessor_14 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (let ((.cse191 (store (store .cse190 v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0))) (let ((.cse192 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_14) .cse189 1) v_arrayElimCell_175 (select .cse191 v_arrayElimCell_175)) 0)) .cse189 1))) (and (= |c_#valid| (store .cse191 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= (select .cse192 0) 1) (= (select .cse192 v_arrayElimCell_175) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_175))))))) .cse28)))) .cse193) (and .cse116 .cse2 .cse194) (and (let ((.cse222 (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (let ((.cse290 (select .cse15 v_prenex_6))) (let ((.cse291 (store (store (store .cse20 .cse290 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0))) (let ((.cse292 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse291 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse290 1) v_arrayElimCell_175 (select .cse291 v_arrayElimCell_175)) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse290 1))) (and (not (= v_arrayElimCell_175 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse290) 0) (= |c_#valid| (store .cse291 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= (select .cse292 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_175)) (not (= .cse290 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= 0 (select .cse292 v_arrayElimCell_175))))))))) (or (and (or (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_127 Int)) (let ((.cse197 (select |c_#valid| v_arrayElimCell_175)) (.cse196 (select .cse15 v_prenex_6))) (let ((.cse195 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse198 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_127) .cse196 1) v_arrayElimCell_175 .cse197) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse198 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse196 1) v_arrayElimCell_175 (select .cse198 v_arrayElimCell_175))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse196 1))) (and (= (select .cse195 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse196 1) v_arrayElimCell_175 .cse197) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= v_arrayElimCell_175 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse196) 0) (= (select .cse195 v_arrayElimCell_175) 0) (not (= .cse196 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (not (= .cse196 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_128 Int)) (let ((.cse200 (select .cse15 v_prenex_6))) (let ((.cse201 (store .cse20 .cse200 1))) (let ((.cse199 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse202 (store (store .cse201 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_128) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse202 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse200 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select .cse202 |v_ULTIMATE.start_freeData_~data#1.base_30|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse200 1))) (and (= (select .cse199 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse200) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse200 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (= |c_#valid| (store (store .cse201 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse200 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse199 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0)))))) (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse203 (select .cse15 v_prenex_6))) (let ((.cse204 (store (store (store .cse20 .cse203 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0))) (let ((.cse205 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse204 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse203 1) v_arrayElimCell_175 (select .cse204 v_arrayElimCell_175)) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse203 1))) (and (not (= v_arrayElimCell_175 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse203) 0) (not (= .cse203 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (= |c_#valid| (store .cse204 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= (select .cse205 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_175)) (not (= .cse203 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= 0 (select .cse205 v_arrayElimCell_175))))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_22 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse206 (select .cse15 v_prenex_6))) (let ((.cse208 (store (store .cse20 .cse206 1) 0 0))) (let ((.cse207 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse208 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse206 1) 0 v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse206 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse206) 0) (not (= .cse206 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (= (select .cse207 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse207 0) 0) (= |c_#valid| (store .cse208 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse206 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_22 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_126 Int)) (let ((.cse210 (select .cse15 v_prenex_6))) (let ((.cse209 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_126) .cse210 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse210 1) 0 v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse210 1))) (and (= (select .cse209 0) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse210) 0) (= (select .cse209 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse210 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= .cse210 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (not (= .cse210 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) .cse11) .cse52 .cse87 .cse101 (exists ((v_arrayElimCell_175 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse212 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse211 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse212 1))) (and (= (select .cse211 v_arrayElimCell_175) 0) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse212) (= v_DerPreprocessor_6 (select .cse211 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= v_arrayElimCell_175 0)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse212 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse212 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_175)))))) (and .cse11 (or (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_27 Int)) (let ((.cse214 (select .cse15 v_prenex_6))) (let ((.cse215 (store (store .cse20 .cse214 1) 0 0))) (let ((.cse213 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse215 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse214 1) 0 v_DerPreprocessor_27) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse214 1))) (and (= (select .cse213 0) 0) (= (select .cse213 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse214) 0) (= |c_#valid| (store .cse215 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse214 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_27 Int) (v_DerPreprocessor_116 Int)) (let ((.cse217 (select .cse15 v_prenex_6))) (let ((.cse216 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_116) .cse217 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse217 1) 0 v_DerPreprocessor_27) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse217 1))) (and (= (select .cse216 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse217) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse217 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= .cse217 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse216 0) 0))))) (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_115 Int)) (let ((.cse219 (select .cse15 v_prenex_6))) (let ((.cse220 (store .cse20 .cse219 1))) (let ((.cse218 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse221 (store (store .cse220 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_115) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse221 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse219 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select .cse221 |v_ULTIMATE.start_freeData_~data#1.base_30|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse219 1))) (and (= (select .cse218 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse219) 0) (= (select .cse218 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= |c_#valid| (store (store .cse220 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse219 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) .cse222 (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (v_DerPreprocessor_114 Int)) (let ((.cse224 (select |c_#valid| v_arrayElimCell_175)) (.cse223 (select .cse15 v_prenex_6))) (let ((.cse225 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse226 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_114) .cse223 1) v_arrayElimCell_175 .cse224) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse226 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse223 1) v_arrayElimCell_175 (select .cse226 v_arrayElimCell_175))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse223 1))) (and (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse223 1) v_arrayElimCell_175 .cse224) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= v_arrayElimCell_175 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse223) 0) (not (= .cse223 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse225 v_arrayElimCell_175) 0) (= (select .cse225 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))))) .cse227 (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse229 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse228 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse229 1))) (and (= (select .cse228 v_arrayElimCell_175) 0) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse229) (= v_DerPreprocessor_6 (select .cse228 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= v_arrayElimCell_175 0)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse229 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= (select .cse15 v_prenex_6) .cse229)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_175)))))) (and .cse28 (or (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_26 Int) (v_DerPreprocessor_122 Int)) (let ((.cse232 (select .cse27 v_prenex_6))) (let ((.cse231 (store |c_ULTIMATE.start_main_old_#valid#1| .cse232 1))) (let ((.cse230 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_26) .cse232 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select (store (store .cse231 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_122) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30|)) 0)) .cse232 1))) (and (= (select .cse230 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= (select .cse230 0) 1) (= |c_#valid| (store (store .cse231 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse232 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse232) 0)))))) (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (v_DerPreprocessor_26 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (let ((.cse235 (select .cse27 v_prenex_6))) (let ((.cse234 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse235 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0))) (let ((.cse233 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_26) .cse235 1) v_arrayElimCell_175 (select .cse234 v_arrayElimCell_175)) 0)) .cse235 1))) (and (= (select .cse233 v_arrayElimCell_175) 0) (= |c_#valid| (store .cse234 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_175)) (= (select .cse233 0) 1) (not (= .cse235 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse235) 0)))))))) (and (or (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_120 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse237 (select .cse15 v_prenex_6))) (let ((.cse239 (store .cse20 .cse237 1))) (let ((.cse236 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse240 (store (store .cse239 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_120) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse240 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse237 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select .cse240 |v_ULTIMATE.start_freeData_~data#1.base_30|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse237 1)) (.cse238 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= (select .cse236 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse236 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse237) 0) (not (= .cse238 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse237 .cse238)) (= |c_#valid| (store (store .cse239 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse237 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_25 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_121 Int)) (let ((.cse242 (select .cse15 v_prenex_6))) (let ((.cse241 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_121) .cse242 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse242 1) 0 v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse242 1)) (.cse243 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= (select .cse241 0) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse242) 0) (not (= .cse243 0)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse242 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select .cse241 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse242 .cse243)) (not (= .cse242 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse244 (select .cse15 v_prenex_6))) (let ((.cse246 (store (store (store .cse20 .cse244 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0))) (let ((.cse245 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse247 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse246 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse244 1) v_arrayElimCell_175 (select .cse246 v_arrayElimCell_175)) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse244 1))) (and (not (= v_arrayElimCell_175 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse244) 0) (not (= .cse245 0)) (not (= .cse244 .cse245)) (= |c_#valid| (store .cse246 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= (select .cse247 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_175)) (not (= .cse244 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= 0 (select .cse247 v_arrayElimCell_175))))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_119 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse249 (select |c_#valid| v_arrayElimCell_175)) (.cse248 (select .cse15 v_prenex_6))) (let ((.cse250 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse251 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse252 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_119) .cse248 1) v_arrayElimCell_175 .cse249) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse252 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse248 1) v_arrayElimCell_175 (select .cse252 v_arrayElimCell_175))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse248 1))) (and (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse248 1) v_arrayElimCell_175 .cse249) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= v_arrayElimCell_175 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse248) 0) (not (= .cse250 0)) (not (= .cse248 .cse250)) (not (= .cse248 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse251 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse251 v_arrayElimCell_175) 0))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_25 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse254 (select .cse15 v_prenex_6))) (let ((.cse256 (store (store .cse20 .cse254 1) 0 0))) (let ((.cse253 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse256 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse254 1) 0 v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse254 1)) (.cse255 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (and (= (select .cse253 0) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse254) 0) (not (= .cse255 0)) (= (select .cse253 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse254 .cse255)) (= |c_#valid| (store .cse256 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse254 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) .cse11) (and (or (and (or (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_19 Int) (v_DerPreprocessor_113 Int)) (let ((.cse259 (select .cse27 v_prenex_6))) (let ((.cse258 (store |c_ULTIMATE.start_main_old_#valid#1| .cse259 1))) (let ((.cse257 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_19) .cse259 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select (store (store .cse258 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_113) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30|)) 0)) .cse259 1))) (and (= (select .cse257 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= (select .cse257 0) 1) (= |c_#valid| (store (store .cse258 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse259 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse259) 0)))))) (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_19 Int)) (let ((.cse262 (select .cse27 v_prenex_6))) (let ((.cse261 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse262 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0))) (let ((.cse260 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_19) .cse262 1) v_arrayElimCell_175 (select .cse261 v_arrayElimCell_175)) 0)) .cse262 1))) (and (= (select .cse260 v_arrayElimCell_175) 0) (= |c_#valid| (store .cse261 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= (select .cse260 0) 1) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_175)) (not (= .cse262 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse262) 0))))))) .cse28) (and (or (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_112 Int)) (let ((.cse264 (select .cse15 v_prenex_6))) (let ((.cse265 (store .cse20 .cse264 1))) (let ((.cse263 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse266 (store (store .cse265 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_112) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse266 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse264 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select .cse266 |v_ULTIMATE.start_freeData_~data#1.base_30|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse264 1))) (and (= (select .cse263 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse264) 0) (= (select .cse263 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= |c_#valid| (store (store .cse265 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse264 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (v_DerPreprocessor_111 Int)) (let ((.cse269 (select |c_#valid| v_arrayElimCell_175)) (.cse268 (select .cse15 v_prenex_6))) (let ((.cse267 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse270 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_111) .cse268 1) v_arrayElimCell_175 .cse269) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse270 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse268 1) v_arrayElimCell_175 (select .cse270 v_arrayElimCell_175))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse268 1))) (and (= (select .cse267 v_arrayElimCell_175) 0) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse268 1) v_arrayElimCell_175 .cse269) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= v_arrayElimCell_175 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse268) 0) (not (= .cse268 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= 1 (select .cse267 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) .cse222 (exists ((v_prenex_6 Int) (v_DerPreprocessor_110 Int) (v_DerPreprocessor_20 Int)) (let ((.cse271 (select .cse15 v_prenex_6))) (let ((.cse272 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_110) .cse271 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse271 1) 0 v_DerPreprocessor_20) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse271 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse271) 0) (= (select .cse272 0) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse271 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= .cse271 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse272 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))) (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_20 Int)) (let ((.cse274 (select .cse15 v_prenex_6))) (let ((.cse275 (store (store .cse20 .cse274 1) 0 0))) (let ((.cse273 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse275 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse274 1) 0 v_DerPreprocessor_20) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse274 1))) (and (= (select .cse273 0) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse274) 0) (= (select .cse273 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store .cse275 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse274 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) .cse11)) .cse49) (and .cse28 (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_24 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_125 Int)) (let ((.cse278 (select .cse27 v_prenex_6))) (let ((.cse279 (store |c_ULTIMATE.start_main_old_#valid#1| .cse278 1))) (let ((.cse277 (select .cse27 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse276 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_24) .cse278 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select (store (store .cse279 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_125) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30|)) 0)) .cse278 1))) (and (= (select .cse276 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (not (= .cse277 .cse278)) (not (= .cse277 0)) (= (select .cse276 0) 1) (= |c_#valid| (store (store .cse279 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse278 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse278) 0)))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_24 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse281 (select .cse27 v_prenex_6))) (let ((.cse282 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse281 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0))) (let ((.cse280 (select .cse27 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse283 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_24) .cse281 1) v_arrayElimCell_175 (select .cse282 v_arrayElimCell_175)) 0)) .cse281 1))) (and (not (= .cse280 .cse281)) (not (= .cse280 0)) (= |c_#valid| (store .cse282 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= 0 (select .cse283 v_arrayElimCell_175)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_175)) (not (= .cse281 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse281) 0) (= (select .cse283 0) 1)))))))) .cse9 .cse109 .cse53 (and (or (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_21 Int)) (let ((.cse285 (select .cse27 v_prenex_6))) (let ((.cse286 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse285 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0))) (let ((.cse284 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_21) .cse285 1) v_arrayElimCell_175 (select .cse286 v_arrayElimCell_175)) 0)) .cse285 1))) (and (= (select .cse284 0) 1) (not (= (select .cse27 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|) .cse285)) (= |c_#valid| (store .cse286 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_175)) (not (= .cse285 0)) (= (select .cse284 v_arrayElimCell_175) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse285) 0)))))) (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_21 Int) (v_DerPreprocessor_117 Int)) (let ((.cse288 (select .cse27 v_prenex_6))) (let ((.cse289 (store |c_ULTIMATE.start_main_old_#valid#1| .cse288 1))) (let ((.cse287 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_21) .cse288 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select (store (store .cse289 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_117) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30|)) 0)) .cse288 1))) (and (= 0 (select .cse287 |v_ULTIMATE.start_freeData_~data#1.base_30|)) (not (= (select .cse27 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|) .cse288)) (= |c_#valid| (store (store .cse289 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse288 0)) (= (select .cse287 0) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse288) 0))))))) .cse28) .cse115)) .cse1) (and (or (and (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_34 Int) (v_arrayElimCell_177 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse293 (select .cse27 v_prenex_6))) (let ((.cse295 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse293 1) v_arrayElimCell_177 (select |c_#valid| v_arrayElimCell_177)) 0 0))) (let ((.cse294 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_34) .cse293 1) v_arrayElimCell_177 (select .cse295 v_arrayElimCell_177)) 0)) .cse293 1))) (and (not (= (select .cse27 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|) .cse293)) (= 0 (select .cse294 v_arrayElimCell_177)) (= |c_#valid| (store .cse295 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= (select .cse294 0) 1) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_177)) (not (= .cse293 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse293) 0)))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_34 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_84 Int)) (let ((.cse297 (select .cse27 v_prenex_6))) (let ((.cse298 (store |c_ULTIMATE.start_main_old_#valid#1| .cse297 1))) (let ((.cse296 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_34) .cse297 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select (store (store .cse298 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_84) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30|)) 0)) .cse297 1))) (and (= (select .cse296 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (not (= (select .cse27 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|) .cse297)) (= |c_#valid| (store (store .cse298 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= (select .cse296 0) 1) (not (= .cse297 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse297) 0))))))) .cse28) (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int) (v_arrayElimCell_178 Int)) (let ((.cse299 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse300 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse299 1)) (.cse301 (select .cse15 v_prenex_6))) (and (not (= v_arrayElimCell_178 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse299) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse299 1) v_arrayElimCell_178 (select |c_#valid| v_arrayElimCell_178)) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= v_DerPreprocessor_6 (select .cse300 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse300 v_arrayElimCell_178) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_178)) (not (= .cse301 0)) (not (= .cse299 0)) (not (= .cse301 .cse299)))))) .cse121 .cse122 (and (or (exists ((v_prenex_6 Int) (v_arrayElimCell_177 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_87 Int)) (let ((.cse303 (select |c_#valid| v_arrayElimCell_177)) (.cse302 (select .cse15 v_prenex_6))) (let ((.cse304 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse305 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_87) .cse302 1) v_arrayElimCell_177 .cse303) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse305 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse302 1) v_arrayElimCell_177 (select .cse305 v_arrayElimCell_177))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse302 1))) (and (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse302 1) v_arrayElimCell_177 .cse303) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= v_arrayElimCell_177 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse302) 0) (not (= .cse302 0)) (= (select .cse304 v_arrayElimCell_177) 0) (not (= .cse302 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (not (= .cse302 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse304 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_35 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse306 (select .cse15 v_prenex_6))) (let ((.cse307 (store (store .cse20 .cse306 1) 0 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse306) 0) (not (= .cse306 0)) (not (= .cse306 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (= |c_#valid| (store .cse307 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse306 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse307 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse306 1) 0 v_DerPreprocessor_35) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse306 1) |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))) .cse163 (exists ((v_prenex_6 Int) (v_DerPreprocessor_88 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse309 (select .cse15 v_prenex_6))) (let ((.cse310 (store .cse20 .cse309 1))) (let ((.cse308 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse311 (store (store .cse310 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_88) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse311 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse309 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select .cse311 |v_ULTIMATE.start_freeData_~data#1.base_30|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse309 1))) (and (= (select .cse308 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse308 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse309) 0) (not (= .cse309 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse309 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (= |c_#valid| (store (store .cse310 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse309 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_35 Int) (v_DerPreprocessor_89 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse312 (select .cse15 v_prenex_6))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_89) .cse312 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse312 1) 0 v_DerPreprocessor_35) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse312 1) |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse312) 0) (not (= .cse312 0)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse312 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= .cse312 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (not (= .cse312 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) .cse11) (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse313 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse314 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse313 1)) (.cse315 (select .cse15 v_prenex_6))) (and (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse313) (= v_DerPreprocessor_6 (select .cse314 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse314 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse313 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse315 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse315 .cse313)))))) (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse317 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse316 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse317 1)) (.cse318 (select .cse15 v_prenex_6))) (and (= (select .cse316 v_arrayElimCell_175) 0) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse317) (= v_DerPreprocessor_6 (select .cse316 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= v_arrayElimCell_175 0)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse317 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse318 0)) (not (= .cse318 .cse317)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_175)))))) (and .cse11 (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_39 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse319 (select .cse15 v_prenex_6))) (let ((.cse320 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse321 (store (store .cse20 .cse319 1) 0 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse319) 0) (not (= .cse319 0)) (not (= .cse320 0)) (not (= .cse319 .cse320)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse321 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse319 1) 0 v_DerPreprocessor_39) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse319 1) |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store .cse321 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse319 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) .cse147 (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_92 Int)) (let ((.cse323 (select .cse15 v_prenex_6))) (let ((.cse325 (store .cse20 .cse323 1))) (let ((.cse324 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse322 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse326 (store (store .cse325 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_92) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse326 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse323 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select .cse326 |v_ULTIMATE.start_freeData_~data#1.base_30|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse323 1))) (and (= (select .cse322 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse323) 0) (not (= .cse323 0)) (not (= .cse324 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse323 .cse324)) (= |c_#valid| (store (store .cse325 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse323 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse322 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_39 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_93 Int)) (let ((.cse328 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse327 (select .cse15 v_prenex_6))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse327) 0) (not (= .cse327 0)) (not (= .cse328 0)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse327 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= .cse327 .cse328)) (not (= .cse327 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_93) .cse327 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse327 1) 0 v_DerPreprocessor_39) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse327 1) |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))) (exists ((v_prenex_6 Int) (v_arrayElimCell_177 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_91 Int)) (let ((.cse330 (select |c_#valid| v_arrayElimCell_177)) (.cse329 (select .cse15 v_prenex_6))) (let ((.cse331 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse332 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse333 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_91) .cse329 1) v_arrayElimCell_177 .cse330) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse333 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse329 1) v_arrayElimCell_177 (select .cse333 v_arrayElimCell_177))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse329 1))) (and (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse329 1) v_arrayElimCell_177 .cse330) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= v_arrayElimCell_177 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse329) 0) (not (= .cse329 0)) (not (= .cse331 0)) (not (= .cse329 .cse331)) (= (select .cse332 v_arrayElimCell_177) 0) (not (= .cse329 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse332 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))))) (and .cse28 (or (exists ((v_prenex_6 Int) (v_arrayElimCell_177 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_38 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int)) (let ((.cse335 (select .cse27 v_prenex_6))) (let ((.cse336 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse335 1) v_arrayElimCell_177 (select |c_#valid| v_arrayElimCell_177)) 0 0))) (let ((.cse334 (select .cse27 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse337 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_38) .cse335 1) v_arrayElimCell_177 (select .cse336 v_arrayElimCell_177)) 0)) .cse335 1))) (and (not (= .cse334 .cse335)) (not (= .cse334 0)) (= |c_#valid| (store .cse336 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= (select .cse337 v_arrayElimCell_177) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_177)) (not (= .cse335 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse335) 0) (= (select .cse337 0) 1)))))) (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_38 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_85 Int)) (let ((.cse340 (select .cse27 v_prenex_6))) (let ((.cse341 (store |c_ULTIMATE.start_main_old_#valid#1| .cse340 1))) (let ((.cse339 (select .cse27 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|)) (.cse338 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_38) .cse340 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select (store (store .cse341 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_85) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30|)) 0)) .cse340 1))) (and (= (select .cse338 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (not (= .cse339 .cse340)) (not (= .cse339 0)) (= |c_#valid| (store (store .cse341 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse340 0)) (= (select .cse338 0) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse340) 0))))))))) .cse1) (and (or (and .cse11 (or (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_103 Int)) (let ((.cse343 (select .cse15 v_prenex_6))) (let ((.cse344 (store .cse20 .cse343 1))) (let ((.cse342 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse345 (store (store .cse344 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_103) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse345 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse343 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select .cse345 |v_ULTIMATE.start_freeData_~data#1.base_30|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse343 1))) (and (= (select .cse342 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse343) 0) (not (= .cse343 0)) (= (select .cse342 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= |c_#valid| (store (store .cse344 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse343 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (v_DerPreprocessor_102 Int)) (let ((.cse348 (select |c_#valid| v_arrayElimCell_175)) (.cse347 (select .cse15 v_prenex_6))) (let ((.cse346 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse349 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_102) .cse347 1) v_arrayElimCell_175 .cse348) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse349 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse347 1) v_arrayElimCell_175 (select .cse349 v_arrayElimCell_175))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse347 1))) (and (= (select .cse346 v_arrayElimCell_175) 0) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse347 1) v_arrayElimCell_175 .cse348) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select .cse346 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= v_arrayElimCell_175 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse347) 0) (not (= .cse347 0)) (not (= .cse347 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (let ((.cse350 (select .cse15 v_prenex_6))) (let ((.cse351 (store (store (store .cse20 .cse350 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0))) (let ((.cse352 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse351 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse350 1) v_arrayElimCell_175 (select .cse351 v_arrayElimCell_175)) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse350 1))) (and (not (= v_arrayElimCell_175 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse350) 0) (not (= .cse350 0)) (= |c_#valid| (store .cse351 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= (select .cse352 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_175)) (not (= .cse350 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= 0 (select .cse352 v_arrayElimCell_175))))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_29 Int) (v_DerPreprocessor_101 Int)) (let ((.cse353 (select .cse15 v_prenex_6))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse353) 0) (not (= .cse353 0)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse353 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_101) .cse353 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse353 1) 0 v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse353 1) |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse353 |c_ULTIMATE.start_main_~#list~0#1.base|))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_29 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (let ((.cse355 (select .cse15 v_prenex_6))) (let ((.cse354 (store (store .cse20 .cse355 1) 0 0))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse354 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse355 1) 0 v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse355 1) |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse355) 0) (not (= .cse355 0)) (= |c_#valid| (store .cse354 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse355 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) (and (or (exists ((|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_arrayElimCell_178 Int) (v_DerPreprocessor_6 Int)) (let ((.cse356 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse357 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse356 1))) (and (not (= v_arrayElimCell_178 0)) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse356) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse356 1) v_arrayElimCell_178 (select |c_#valid| v_arrayElimCell_178)) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= v_DerPreprocessor_6 (select .cse357 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse357 v_arrayElimCell_178) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_178)) (not (= .cse356 0)))))) .cse52 .cse53) .cse8) (and (or (exists ((v_prenex_6 Int) (v_DerPreprocessor_28 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_95 Int)) (let ((.cse360 (select .cse27 v_prenex_6))) (let ((.cse358 (store |c_ULTIMATE.start_main_old_#valid#1| .cse360 1))) (let ((.cse359 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_28) .cse360 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select (store (store .cse358 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_95) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30|)) 0)) .cse360 1))) (and (= |c_#valid| (store (store .cse358 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= (select .cse359 0) 1) (not (= .cse360 0)) (= (select .cse359 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse360) 0)))))) (exists ((v_prenex_6 Int) (v_arrayElimCell_175 Int) (v_DerPreprocessor_28 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (let ((.cse363 (select .cse27 v_prenex_6))) (let ((.cse362 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse363 1) v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0))) (let ((.cse361 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_28) .cse363 1) v_arrayElimCell_175 (select .cse362 v_arrayElimCell_175)) 0)) .cse363 1))) (and (= (select .cse361 0) 1) (= |c_#valid| (store .cse362 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_175)) (not (= .cse363 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse363) 0) (= (select .cse361 v_arrayElimCell_175) 0))))))) .cse28) (and (or (and .cse28 (or (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_96 Int)) (let ((.cse366 (select .cse27 v_prenex_6))) (let ((.cse365 (store |c_ULTIMATE.start_main_old_#valid#1| .cse366 1))) (let ((.cse364 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_31) .cse366 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select (store (store .cse365 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_96) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30|)) 0)) .cse366 1))) (and (= (select .cse364 0) 1) (= |c_#valid| (store (store .cse365 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse366 0)) (= (select .cse364 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse366) 0)))))) (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_arrayElimCell_178 Int) (v_DerPreprocessor_31 Int)) (let ((.cse369 (select .cse27 v_prenex_6))) (let ((.cse367 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse369 1) v_arrayElimCell_178 (select |c_#valid| v_arrayElimCell_178)) 0 0))) (let ((.cse368 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_31) .cse369 1) v_arrayElimCell_178 (select .cse367 v_arrayElimCell_178)) 0)) .cse369 1))) (and (= |c_#valid| (store .cse367 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_178)) (= (select .cse368 v_arrayElimCell_178) 0) (= (select .cse368 0) 1) (not (= .cse369 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse369) 0)))))))) (and .cse11 (or (exists ((v_prenex_6 Int) (v_arrayElimCell_178 Int) (v_DerPreprocessor_98 Int)) (let ((.cse372 (select |c_#valid| v_arrayElimCell_178)) (.cse371 (select .cse15 v_prenex_6))) (let ((.cse370 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse373 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_98) .cse371 1) v_arrayElimCell_178 .cse372) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse373 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse371 1) v_arrayElimCell_178 (select .cse373 v_arrayElimCell_178))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse371 1))) (and (= (select .cse370 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= v_arrayElimCell_178 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse371) 0) (not (= .cse371 0)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse371 1) v_arrayElimCell_178 .cse372) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= .cse371 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse370 v_arrayElimCell_178) 0))))) (exists ((v_prenex_6 Int) (v_DerPreprocessor_99 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (let ((.cse375 (select .cse15 v_prenex_6))) (let ((.cse376 (store .cse20 .cse375 1))) (let ((.cse374 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse377 (store (store .cse376 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_99) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse377 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse375 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select .cse377 |v_ULTIMATE.start_freeData_~data#1.base_30|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse375 1))) (and (= (select .cse374 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse375) 0) (not (= .cse375 0)) (= (select .cse374 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= |c_#valid| (store (store .cse376 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse375 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) .cse35 (exists ((v_prenex_6 Int) (v_DerPreprocessor_97 Int) (v_DerPreprocessor_32 Int)) (let ((.cse379 (select .cse15 v_prenex_6))) (let ((.cse378 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_97) .cse379 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse379 1) 0 v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse379 1))) (and (= (select .cse378 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse378 0) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse379) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse379 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= .cse379 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (exists ((v_prenex_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_32 Int)) (let ((.cse381 (select .cse15 v_prenex_6))) (let ((.cse382 (store (store .cse20 .cse381 1) 0 0))) (let ((.cse380 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse382 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse381 1) 0 v_DerPreprocessor_32) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse381 1))) (and (= (select .cse380 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse381) 0) (= (select .cse380 0) 0) (= |c_#valid| (store .cse382 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= .cse381 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))))) .cse49) (and (or .cse52 .cse227 (exists ((v_arrayElimCell_175 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_41| Int) (v_DerPreprocessor_6 Int)) (let ((.cse384 (select .cse15 |v_ULTIMATE.start_append_~pointerToList#1.offset_41|))) (let ((.cse383 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse384 1))) (and (= (select .cse383 v_arrayElimCell_175) 0) (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse384) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse384 1) 0 0) v_arrayElimCell_175 0)) (= v_DerPreprocessor_6 (select .cse383 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= v_arrayElimCell_175 0))))))) .cse8)) .cse1) (and (or (and .cse2 .cse194) (and .cse173 (or (and (or (and .cse185 (exists ((v_DerPreprocessor_78 Int) (v_DerPreprocessor_42 Int)) (let ((.cse385 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_78) .cse7 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse7 1) 0 v_DerPreprocessor_42) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse7 1))) (and (= (select .cse385 0) 0) (= (select .cse385 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))) .cse181 (exists ((v_DerPreprocessor_79 Int) (v_arrayElimCell_175 Int)) (let ((.cse386 (select |c_#valid| v_arrayElimCell_175))) (let ((.cse387 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse388 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_79) .cse7 1) v_arrayElimCell_175 .cse386) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse388 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse7 1) v_arrayElimCell_175 (select .cse388 v_arrayElimCell_175))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse7 1))) (and (not (= v_arrayElimCell_175 0)) (= |c_#valid| (store (store (store .cse6 v_arrayElimCell_175 .cse386) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select .cse387 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse387 v_arrayElimCell_175) 0))))) (and .cse182 (exists ((v_DerPreprocessor_42 Int)) (let ((.cse389 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse184 0 v_DerPreprocessor_42) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse7 1))) (and (= (select .cse389 0) 0) (= (select .cse389 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_80 Int)) (let ((.cse390 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse391 (store (store .cse180 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_80) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse391 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse7 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select .cse391 |v_ULTIMATE.start_freeData_~data#1.base_30|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse7 1))) (and (= |c_#valid| (store .cse177 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= (select .cse390 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse390 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)))))) .cse11) (and (or (exists ((v_arrayElimCell_175 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_41 Int)) (let ((.cse393 (store (store .cse190 v_arrayElimCell_175 (select |c_#valid| v_arrayElimCell_175)) 0 0))) (let ((.cse392 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_41) .cse189 1) v_arrayElimCell_175 (select .cse393 v_arrayElimCell_175)) 0)) .cse189 1))) (and (= (select .cse392 v_arrayElimCell_175) 0) (= (select .cse392 0) 1) (= |c_#valid| (store .cse393 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| v_arrayElimCell_175)))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_81 Int) (v_DerPreprocessor_41 Int)) (let ((.cse394 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_41) .cse189 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select (store (store .cse190 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_81) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30|)) 0)) .cse189 1))) (and (= |c_#valid| (store .cse187 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= (select .cse394 0) 1) (= (select .cse394 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0))))) .cse28)))) .cse193))))) (and (or (and .cse173 (or (and .cse11 (or (exists ((v_DerPreprocessor_161 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int)) (let ((.cse402 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse403 (store (store .cse180 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_161) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse403 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse7 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select .cse403 |v_ULTIMATE.start_freeData_~data#1.base_30|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse7 1))) (and (= |c_#valid| (store .cse177 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= (select .cse402 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= (select .cse402 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))) (and (exists ((v_DerPreprocessor_46 Int)) (let ((.cse404 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse184 0 v_DerPreprocessor_46) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse7 1))) (and (= (select .cse404 0) 0) (= (select .cse404 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))) (= |c_#valid| .cse177)))) (and (exists ((v_DerPreprocessor_45 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_163 Int)) (let ((.cse405 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_45) .cse189 1) |v_ULTIMATE.start_freeData_~data#1.base_30| (select (store (store .cse190 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_163) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30|)) 0)) .cse189 1))) (and (= |c_#valid| (store .cse187 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= (select .cse405 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0) (= (select .cse405 0) 1)))) .cse28))) (and .cse2 (exists ((v_prenex_7 Int) (|v_ULTIMATE.start_freeData_~data#1.base_30| Int) (v_DerPreprocessor_159 Int)) (let ((.cse406 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_7) .cse7 1))) (and (= |c_#valid| (store .cse4 |v_ULTIMATE.start_freeData_~data#1.base_30| 0)) (= (select .cse406 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_7) (= (select (store (store .cse6 |v_ULTIMATE.start_freeData_~data#1.base_30| v_DerPreprocessor_159) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_30|) v_DerPreprocessor_159) (= (select .cse406 |v_ULTIMATE.start_freeData_~data#1.base_30|) 0)))))) .cse193)))))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base|) 0))))) is different from false