./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.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_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB --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 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 19:56:07,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 19:56:07,354 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-27 19:56:07,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 19:56:07,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 19:56:07,401 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 19:56:07,402 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 19:56:07,402 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 19:56:07,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 19:56:07,402 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 19:56:07,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 19:56:07,403 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 19:56:07,403 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 19:56:07,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 19:56:07,403 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 19:56:07,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 19:56:07,403 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 19:56:07,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 19:56:07,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 19:56:07,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 19:56:07,404 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 19:56:07,404 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 19:56:07,404 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 19:56:07,404 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 19:56:07,404 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 19:56:07,404 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 19:56:07,405 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 19:56:07,405 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 19:56:07,405 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 19:56:07,405 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 19:56:07,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:56:07,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:56:07,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:56:07,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:56:07,407 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 19:56:07,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:56:07,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:56:07,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:56:07,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:56:07,408 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 19:56:07,408 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 19:56:07,408 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 19:56:07,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 19:56:07,408 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 19:56:07,409 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 19:56:07,409 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 19:56:07,409 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 19:56:07,409 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_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 [2024-11-27 19:56:07,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 19:56:07,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 19:56:07,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 19:56:07,742 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 19:56:07,742 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 19:56:07,743 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2024-11-27 19:56:10,675 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/data/e7a22057f/f1d298deed9e4a93b601a019d27236a1/FLAGb6f6c1de6 [2024-11-27 19:56:10,969 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 19:56:10,970 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2024-11-27 19:56:10,981 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/data/e7a22057f/f1d298deed9e4a93b601a019d27236a1/FLAGb6f6c1de6 [2024-11-27 19:56:10,998 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/data/e7a22057f/f1d298deed9e4a93b601a019d27236a1 [2024-11-27 19:56:11,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 19:56:11,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 19:56:11,004 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 19:56:11,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 19:56:11,009 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 19:56:11,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:56:10" (1/1) ... [2024-11-27 19:56:11,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a1acf85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:56:11, skipping insertion in model container [2024-11-27 19:56:11,011 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:56:10" (1/1) ... [2024-11-27 19:56:11,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 19:56:11,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:56:11,502 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 19:56:11,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:56:11,624 INFO L204 MainTranslator]: Completed translation [2024-11-27 19:56:11,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:56:11 WrapperNode [2024-11-27 19:56:11,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 19:56:11,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 19:56:11,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 19:56:11,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 19:56:11,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:56:11" (1/1) ... [2024-11-27 19:56:11,650 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:56:11" (1/1) ... [2024-11-27 19:56:11,680 INFO L138 Inliner]: procedures = 127, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 118 [2024-11-27 19:56:11,680 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 19:56:11,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 19:56:11,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 19:56:11,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 19:56:11,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:56:11" (1/1) ... [2024-11-27 19:56:11,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:56:11" (1/1) ... [2024-11-27 19:56:11,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:56:11" (1/1) ... [2024-11-27 19:56:11,717 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 12, 7]. 57 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2024-11-27 19:56:11,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:56:11" (1/1) ... [2024-11-27 19:56:11,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:56:11" (1/1) ... [2024-11-27 19:56:11,732 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:56:11" (1/1) ... [2024-11-27 19:56:11,733 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:56:11" (1/1) ... [2024-11-27 19:56:11,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:56:11" (1/1) ... [2024-11-27 19:56:11,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:56:11" (1/1) ... [2024-11-27 19:56:11,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:56:11" (1/1) ... [2024-11-27 19:56:11,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 19:56:11,752 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 19:56:11,752 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 19:56:11,752 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 19:56:11,754 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:56:11" (1/1) ... [2024-11-27 19:56:11,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:56:11,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:56:11,798 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 19:56:11,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 19:56:11,836 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-27 19:56:11,839 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-27 19:56:11,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-27 19:56:11,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-27 19:56:11,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-27 19:56:11,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-27 19:56:11,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-27 19:56:11,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-27 19:56:11,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 19:56:11,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 19:56:11,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 19:56:11,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-27 19:56:11,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-27 19:56:11,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-27 19:56:11,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-27 19:56:11,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-27 19:56:11,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-27 19:56:11,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 19:56:11,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-27 19:56:11,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-27 19:56:11,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-27 19:56:11,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 19:56:11,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-27 19:56:11,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-27 19:56:11,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 19:56:11,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 19:56:12,003 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 19:56:12,005 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 19:56:12,026 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-27 19:56:12,463 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-27 19:56:12,463 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 19:56:12,475 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 19:56:12,476 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-27 19:56:12,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:56:12 BoogieIcfgContainer [2024-11-27 19:56:12,476 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 19:56:12,479 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 19:56:12,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 19:56:12,486 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 19:56:12,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 07:56:10" (1/3) ... [2024-11-27 19:56:12,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6682ea28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:56:12, skipping insertion in model container [2024-11-27 19:56:12,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:56:11" (2/3) ... [2024-11-27 19:56:12,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6682ea28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:56:12, skipping insertion in model container [2024-11-27 19:56:12,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:56:12" (3/3) ... [2024-11-27 19:56:12,489 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal.i [2024-11-27 19:56:12,511 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 19:56:12,513 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_prepend_equal.i that has 2 procedures, 99 locations, 1 initial locations, 3 loop locations, and 41 error locations. [2024-11-27 19:56:12,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 19:56:12,572 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;@25c43653, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 19:56:12,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-11-27 19:56:12,576 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 54 states have (on average 2.0) internal successors, (108), 96 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:12,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-27 19:56:12,581 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:56:12,582 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-27 19:56:12,582 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 19:56:12,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:56:12,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1037518442, now seen corresponding path program 1 times [2024-11-27 19:56:12,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:56:12,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089886730] [2024-11-27 19:56:12,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:12,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:56:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:12,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:56:12,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:56:12,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089886730] [2024-11-27 19:56:12,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089886730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:56:12,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:56:12,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:56:12,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829214455] [2024-11-27 19:56:12,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:56:12,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:56:12,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:56:12,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:56:12,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:56:12,920 INFO L87 Difference]: Start difference. First operand has 98 states, 54 states have (on average 2.0) internal successors, (108), 96 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:13,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:56:13,093 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2024-11-27 19:56:13,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:56:13,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-27 19:56:13,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:56:13,101 INFO L225 Difference]: With dead ends: 94 [2024-11-27 19:56:13,101 INFO L226 Difference]: Without dead ends: 88 [2024-11-27 19:56:13,103 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-11-27 19:56:13,106 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 9 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:56:13,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 139 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:56:13,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-27 19:56:13,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-27 19:56:13,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 50 states have (on average 1.86) internal successors, (93), 87 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:13,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2024-11-27 19:56:13,149 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 6 [2024-11-27 19:56:13,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:56:13,149 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2024-11-27 19:56:13,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2024-11-27 19:56:13,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-27 19:56:13,149 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:56:13,150 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-27 19:56:13,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 19:56:13,153 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 19:56:13,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:56:13,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1037518443, now seen corresponding path program 1 times [2024-11-27 19:56:13,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:56:13,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286431680] [2024-11-27 19:56:13,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:13,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:56:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:13,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:56:13,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:56:13,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286431680] [2024-11-27 19:56:13,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286431680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:56:13,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:56:13,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:56:13,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369936979] [2024-11-27 19:56:13,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:56:13,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:56:13,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:56:13,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:56:13,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:56:13,297 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:13,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:56:13,399 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2024-11-27 19:56:13,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:56:13,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-27 19:56:13,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:56:13,400 INFO L225 Difference]: With dead ends: 85 [2024-11-27 19:56:13,400 INFO L226 Difference]: Without dead ends: 85 [2024-11-27 19:56:13,401 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-11-27 19:56:13,401 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 8 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:56:13,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 131 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:56:13,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-27 19:56:13,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-27 19:56:13,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.8) internal successors, (90), 84 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:13,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-11-27 19:56:13,412 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 6 [2024-11-27 19:56:13,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:56:13,412 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-11-27 19:56:13,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:13,413 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-11-27 19:56:13,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-27 19:56:13,413 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:56:13,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:56:13,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 19:56:13,413 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 19:56:13,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:56:13,414 INFO L85 PathProgramCache]: Analyzing trace with hash 2101067345, now seen corresponding path program 1 times [2024-11-27 19:56:13,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:56:13,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566612453] [2024-11-27 19:56:13,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:13,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:56:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:13,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:56:13,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:56:13,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566612453] [2024-11-27 19:56:13,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566612453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:56:13,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:56:13,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:56:13,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032224381] [2024-11-27 19:56:13,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:56:13,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:56:13,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:56:13,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:56:13,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:56:13,496 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:13,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:56:13,522 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2024-11-27 19:56:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:56:13,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2024-11-27 19:56:13,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:56:13,525 INFO L225 Difference]: With dead ends: 96 [2024-11-27 19:56:13,526 INFO L226 Difference]: Without dead ends: 96 [2024-11-27 19:56:13,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:56:13,526 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 11 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:56:13,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 173 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:56:13,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-27 19:56:13,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 86. [2024-11-27 19:56:13,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 85 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:13,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2024-11-27 19:56:13,540 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 7 [2024-11-27 19:56:13,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:56:13,540 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2024-11-27 19:56:13,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:13,540 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2024-11-27 19:56:13,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-27 19:56:13,541 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:56:13,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:56:13,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 19:56:13,541 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 19:56:13,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:56:13,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1519983918, now seen corresponding path program 1 times [2024-11-27 19:56:13,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:56:13,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073574460] [2024-11-27 19:56:13,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:13,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:56:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:13,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:56:13,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:56:13,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073574460] [2024-11-27 19:56:13,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073574460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:56:13,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:56:13,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:56:13,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456353242] [2024-11-27 19:56:13,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:56:13,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:56:13,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:56:13,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:56:13,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:56:13,648 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:13,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:56:13,671 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2024-11-27 19:56:13,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:56:13,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-11-27 19:56:13,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:56:13,672 INFO L225 Difference]: With dead ends: 92 [2024-11-27 19:56:13,672 INFO L226 Difference]: Without dead ends: 92 [2024-11-27 19:56:13,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:56:13,673 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:56:13,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:56:13,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-27 19:56:13,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-27 19:56:13,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 91 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:13,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2024-11-27 19:56:13,678 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 10 [2024-11-27 19:56:13,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:56:13,678 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2024-11-27 19:56:13,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:13,679 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2024-11-27 19:56:13,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-27 19:56:13,679 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:56:13,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:56:13,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 19:56:13,679 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 19:56:13,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:56:13,680 INFO L85 PathProgramCache]: Analyzing trace with hash 973131718, now seen corresponding path program 1 times [2024-11-27 19:56:13,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:56:13,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157798478] [2024-11-27 19:56:13,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:13,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:56:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:56:13,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:56:13,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157798478] [2024-11-27 19:56:13,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157798478] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:56:13,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532144897] [2024-11-27 19:56:13,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:13,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:56:13,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:56:13,870 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:56:13,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 19:56:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:13,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 19:56:13,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:56:14,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:56:14,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:56:14,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:56:14,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532144897] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 19:56:14,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 19:56:14,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-27 19:56:14,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10759613] [2024-11-27 19:56:14,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 19:56:14,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:56:14,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:56:14,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:56:14,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:56:14,098 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:14,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:56:14,131 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2024-11-27 19:56:14,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:56:14,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-27 19:56:14,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:56:14,132 INFO L225 Difference]: With dead ends: 94 [2024-11-27 19:56:14,132 INFO L226 Difference]: Without dead ends: 94 [2024-11-27 19:56:14,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:56:14,133 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 11 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:56:14,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 248 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:56:14,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-27 19:56:14,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-27 19:56:14,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 59 states have (on average 1.6779661016949152) internal successors, (99), 93 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:14,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2024-11-27 19:56:14,143 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 15 [2024-11-27 19:56:14,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:56:14,143 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2024-11-27 19:56:14,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:14,144 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2024-11-27 19:56:14,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-27 19:56:14,144 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:56:14,144 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-27 19:56:14,156 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 19:56:14,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:56:14,345 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 19:56:14,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:56:14,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1281123431, now seen corresponding path program 1 times [2024-11-27 19:56:14,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:56:14,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150269233] [2024-11-27 19:56:14,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:14,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:56:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:56:14,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:56:14,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150269233] [2024-11-27 19:56:14,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150269233] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:56:14,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879507405] [2024-11-27 19:56:14,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:14,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:56:14,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:56:14,580 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:56:14,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 19:56:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:14,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-27 19:56:14,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:56:14,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 19:56:14,798 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-27 19:56:14,800 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 12 treesize of output 14 [2024-11-27 19:56:14,851 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:56:14,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:56:14,923 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:56:14,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879507405] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 19:56:14,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 19:56:14,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-27 19:56:14,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470965596] [2024-11-27 19:56:14,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 19:56:14,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:56:14,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:56:14,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:56:14,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:56:14,927 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:15,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:56:15,106 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2024-11-27 19:56:15,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:56:15,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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 18 [2024-11-27 19:56:15,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:56:15,108 INFO L225 Difference]: With dead ends: 93 [2024-11-27 19:56:15,108 INFO L226 Difference]: Without dead ends: 93 [2024-11-27 19:56:15,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:56:15,109 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:56:15,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 167 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 19:56:15,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-27 19:56:15,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-27 19:56:15,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 59 states have (on average 1.6610169491525424) internal successors, (98), 92 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2024-11-27 19:56:15,123 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 18 [2024-11-27 19:56:15,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:56:15,123 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2024-11-27 19:56:15,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:15,123 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2024-11-27 19:56:15,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-27 19:56:15,124 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:56:15,124 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-27 19:56:15,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-27 19:56:15,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-27 19:56:15,328 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 19:56:15,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:56:15,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1281123430, now seen corresponding path program 1 times [2024-11-27 19:56:15,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:56:15,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986875191] [2024-11-27 19:56:15,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:15,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:56:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:15,727 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:56:15,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:56:15,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986875191] [2024-11-27 19:56:15,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986875191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:56:15,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339361492] [2024-11-27 19:56:15,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:15,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:56:15,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:56:15,732 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:56:15,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 19:56:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:15,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-27 19:56:15,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:56:15,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-27 19:56:16,050 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-27 19:56:16,051 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 14 treesize of output 13 [2024-11-27 19:56:16,119 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:56:16,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:56:16,480 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:56:16,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339361492] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 19:56:16,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 19:56:16,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 4] total 10 [2024-11-27 19:56:16,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714249309] [2024-11-27 19:56:16,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 19:56:16,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 19:56:16,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:56:16,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 19:56:16,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-27 19:56:16,483 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:16,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:56:16,787 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2024-11-27 19:56:16,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:56:16,788 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-27 19:56:16,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:56:16,789 INFO L225 Difference]: With dead ends: 92 [2024-11-27 19:56:16,789 INFO L226 Difference]: Without dead ends: 92 [2024-11-27 19:56:16,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-27 19:56:16,790 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 12 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 19:56:16,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 372 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 19:56:16,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-27 19:56:16,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-27 19:56:16,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.6440677966101696) internal successors, (97), 91 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:16,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2024-11-27 19:56:16,795 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 18 [2024-11-27 19:56:16,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:56:16,796 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2024-11-27 19:56:16,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:16,796 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2024-11-27 19:56:16,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-27 19:56:16,796 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:56:16,796 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:56:16,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-27 19:56:16,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-27 19:56:16,997 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 19:56:16,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:56:16,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1335124933, now seen corresponding path program 2 times [2024-11-27 19:56:16,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:56:16,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750956326] [2024-11-27 19:56:16,998 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 19:56:16,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:56:17,021 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 19:56:17,022 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 19:56:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-27 19:56:17,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:56:17,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750956326] [2024-11-27 19:56:17,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750956326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:56:17,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:56:17,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:56:17,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120613880] [2024-11-27 19:56:17,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:56:17,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:56:17,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:56:17,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:56:17,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:56:17,058 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:17,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:56:17,141 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2024-11-27 19:56:17,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:56:17,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-27 19:56:17,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:56:17,142 INFO L225 Difference]: With dead ends: 89 [2024-11-27 19:56:17,142 INFO L226 Difference]: Without dead ends: 89 [2024-11-27 19:56:17,143 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-11-27 19:56:17,144 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 3 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:56:17,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 119 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:56:17,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-27 19:56:17,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-27 19:56:17,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 88 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:17,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2024-11-27 19:56:17,154 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 23 [2024-11-27 19:56:17,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:56:17,155 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2024-11-27 19:56:17,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:17,155 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2024-11-27 19:56:17,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-27 19:56:17,158 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:56:17,158 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:56:17,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 19:56:17,158 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 19:56:17,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:56:17,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1335124932, now seen corresponding path program 1 times [2024-11-27 19:56:17,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:56:17,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142090001] [2024-11-27 19:56:17,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:17,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:56:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:17,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:56:17,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:56:17,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142090001] [2024-11-27 19:56:17,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142090001] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:56:17,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256312454] [2024-11-27 19:56:17,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:17,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:56:17,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:56:17,262 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:56:17,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 19:56:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:17,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 19:56:17,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:56:17,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:56:17,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:56:17,459 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:56:17,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256312454] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 19:56:17,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 19:56:17,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-27 19:56:17,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696101808] [2024-11-27 19:56:17,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 19:56:17,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:56:17,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:56:17,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:56:17,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:56:17,462 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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-11-27 19:56:17,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:56:17,503 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2024-11-27 19:56:17,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:56:17,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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-11-27 19:56:17,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:56:17,505 INFO L225 Difference]: With dead ends: 89 [2024-11-27 19:56:17,505 INFO L226 Difference]: Without dead ends: 89 [2024-11-27 19:56:17,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:56:17,506 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:56:17,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 226 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:56:17,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-27 19:56:17,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-27 19:56:17,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 59 states have (on average 1.576271186440678) internal successors, (93), 88 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:17,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2024-11-27 19:56:17,510 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 23 [2024-11-27 19:56:17,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:56:17,511 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2024-11-27 19:56:17,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:17,511 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2024-11-27 19:56:17,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-27 19:56:17,512 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:56:17,512 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:56:17,521 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-27 19:56:17,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-27 19:56:17,713 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 19:56:17,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:56:17,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1178626338, now seen corresponding path program 1 times [2024-11-27 19:56:17,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:56:17,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460758362] [2024-11-27 19:56:17,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:17,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:56:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:17,859 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-27 19:56:17,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:56:17,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460758362] [2024-11-27 19:56:17,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460758362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:56:17,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:56:17,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:56:17,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716734881] [2024-11-27 19:56:17,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:56:17,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:56:17,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:56:17,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:56:17,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:56:17,861 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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-11-27 19:56:17,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:56:17,931 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2024-11-27 19:56:17,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:56:17,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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 24 [2024-11-27 19:56:17,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:56:17,932 INFO L225 Difference]: With dead ends: 86 [2024-11-27 19:56:17,932 INFO L226 Difference]: Without dead ends: 86 [2024-11-27 19:56:17,933 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-11-27 19:56:17,933 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 3 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:56:17,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 123 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:56:17,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-27 19:56:17,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-27 19:56:17,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 85 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:17,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2024-11-27 19:56:17,941 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 24 [2024-11-27 19:56:17,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:56:17,948 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2024-11-27 19:56:17,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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-11-27 19:56:17,948 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2024-11-27 19:56:17,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-27 19:56:17,949 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:56:17,949 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:56:17,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 19:56:17,949 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 19:56:17,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:56:17,949 INFO L85 PathProgramCache]: Analyzing trace with hash 144666817, now seen corresponding path program 1 times [2024-11-27 19:56:17,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:56:17,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662951953] [2024-11-27 19:56:17,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:17,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:56:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:18,398 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 19:56:18,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:56:18,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662951953] [2024-11-27 19:56:18,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662951953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:56:18,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799380797] [2024-11-27 19:56:18,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:18,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:56:18,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:56:18,401 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:56:18,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 19:56:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:18,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-27 19:56:18,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:56:18,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 19:56:18,589 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-27 19:56:18,589 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 14 treesize of output 13 [2024-11-27 19:56:18,674 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-27 19:56:18,674 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 16 treesize of output 22 [2024-11-27 19:56:18,845 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-27 19:56:18,846 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 12 treesize of output 14 [2024-11-27 19:56:18,878 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 19:56:18,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:56:19,084 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 19:56:19,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799380797] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 19:56:19,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 19:56:19,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2024-11-27 19:56:19,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911421651] [2024-11-27 19:56:19,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 19:56:19,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 19:56:19,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:56:19,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 19:56:19,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-27 19:56:19,089 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:19,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:56:19,253 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2024-11-27 19:56:19,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:56:19,254 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-27 19:56:19,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:56:19,255 INFO L225 Difference]: With dead ends: 92 [2024-11-27 19:56:19,255 INFO L226 Difference]: Without dead ends: 92 [2024-11-27 19:56:19,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-27 19:56:19,256 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 144 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:56:19,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 120 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:56:19,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-27 19:56:19,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2024-11-27 19:56:19,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 59 states have (on average 1.423728813559322) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:19,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-11-27 19:56:19,266 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 29 [2024-11-27 19:56:19,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:56:19,266 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-11-27 19:56:19,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:19,267 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-11-27 19:56:19,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-27 19:56:19,271 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:56:19,271 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:56:19,281 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-27 19:56:19,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-27 19:56:19,472 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 19:56:19,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:56:19,473 INFO L85 PathProgramCache]: Analyzing trace with hash 144666818, now seen corresponding path program 1 times [2024-11-27 19:56:19,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:56:19,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356224156] [2024-11-27 19:56:19,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:19,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:56:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:56:20,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:56:20,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356224156] [2024-11-27 19:56:20,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356224156] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:56:20,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123563392] [2024-11-27 19:56:20,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:20,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:56:20,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:56:20,106 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:56:20,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 19:56:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:20,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-27 19:56:20,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:56:20,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 19:56:20,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-27 19:56:20,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:56:20,335 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 12 treesize of output 14 [2024-11-27 19:56:20,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:56:20,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-27 19:56:20,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:56:20,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-27 19:56:20,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:56:20,596 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-27 19:56:20,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-27 19:56:20,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:56:20,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-27 19:56:20,733 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:56:20,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:56:29,689 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:56:29,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123563392] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 19:56:29,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 19:56:29,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 13 [2024-11-27 19:56:29,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469225080] [2024-11-27 19:56:29,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 19:56:29,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-27 19:56:29,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:56:29,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-27 19:56:29,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=127, Unknown=2, NotChecked=0, Total=182 [2024-11-27 19:56:29,692 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 14 states, 13 states have (on average 5.846153846153846) internal successors, (76), 14 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:29,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:56:29,955 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2024-11-27 19:56:29,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 19:56:29,956 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.846153846153846) internal successors, (76), 14 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-27 19:56:29,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:56:29,956 INFO L225 Difference]: With dead ends: 74 [2024-11-27 19:56:29,957 INFO L226 Difference]: Without dead ends: 74 [2024-11-27 19:56:29,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=64, Invalid=144, Unknown=2, NotChecked=0, Total=210 [2024-11-27 19:56:29,958 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 155 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:56:29,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 165 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 19:56:29,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-27 19:56:29,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-27 19:56:29,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 73 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:29,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2024-11-27 19:56:29,962 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 29 [2024-11-27 19:56:29,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:56:29,963 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2024-11-27 19:56:29,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.846153846153846) internal successors, (76), 14 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:29,963 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2024-11-27 19:56:29,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-27 19:56:29,964 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:56:29,964 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:56:29,974 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-27 19:56:30,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:56:30,165 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 19:56:30,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:56:30,165 INFO L85 PathProgramCache]: Analyzing trace with hash 189704073, now seen corresponding path program 1 times [2024-11-27 19:56:30,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:56:30,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916840857] [2024-11-27 19:56:30,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:30,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:56:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-27 19:56:30,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:56:30,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916840857] [2024-11-27 19:56:30,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916840857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:56:30,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:56:30,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:56:30,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736106615] [2024-11-27 19:56:30,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:56:30,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:56:30,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:56:30,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:56:30,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:56:30,297 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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-11-27 19:56:30,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:56:30,421 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2024-11-27 19:56:30,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:56:30,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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 30 [2024-11-27 19:56:30,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:56:30,422 INFO L225 Difference]: With dead ends: 73 [2024-11-27 19:56:30,422 INFO L226 Difference]: Without dead ends: 73 [2024-11-27 19:56:30,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:56:30,423 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:56:30,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 154 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:56:30,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-27 19:56:30,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-27 19:56:30,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.305084745762712) internal successors, (77), 72 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2024-11-27 19:56:30,427 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 30 [2024-11-27 19:56:30,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:56:30,428 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2024-11-27 19:56:30,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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-11-27 19:56:30,429 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2024-11-27 19:56:30,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-27 19:56:30,431 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:56:30,431 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:56:30,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 19:56:30,431 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 19:56:30,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:56:30,432 INFO L85 PathProgramCache]: Analyzing trace with hash 189704074, now seen corresponding path program 1 times [2024-11-27 19:56:30,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:56:30,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406038319] [2024-11-27 19:56:30,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:30,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:56:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-27 19:56:30,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:56:30,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406038319] [2024-11-27 19:56:30,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406038319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:56:30,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:56:30,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:56:30,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235843726] [2024-11-27 19:56:30,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:56:30,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:56:30,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:56:30,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:56:30,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:56:30,665 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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-11-27 19:56:30,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:56:30,780 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2024-11-27 19:56:30,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:56:30,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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 30 [2024-11-27 19:56:30,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:56:30,781 INFO L225 Difference]: With dead ends: 72 [2024-11-27 19:56:30,781 INFO L226 Difference]: Without dead ends: 72 [2024-11-27 19:56:30,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:56:30,782 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 10 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:56:30,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 166 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:56:30,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-27 19:56:30,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-27 19:56:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:30,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-11-27 19:56:30,785 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 30 [2024-11-27 19:56:30,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:56:30,785 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-11-27 19:56:30,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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-11-27 19:56:30,786 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-11-27 19:56:30,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-27 19:56:30,786 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:56:30,786 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-27 19:56:30,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 19:56:30,787 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 19:56:30,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:56:30,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1155959092, now seen corresponding path program 1 times [2024-11-27 19:56:30,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:56:30,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872030847] [2024-11-27 19:56:30,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:30,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:56:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:31,151 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 19:56:31,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:56:31,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872030847] [2024-11-27 19:56:31,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872030847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:56:31,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:56:31,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 19:56:31,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947312200] [2024-11-27 19:56:31,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:56:31,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 19:56:31,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:56:31,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 19:56:31,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 19:56:31,154 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 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-11-27 19:56:31,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:56:31,395 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2024-11-27 19:56:31,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 19:56:31,396 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 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 35 [2024-11-27 19:56:31,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:56:31,396 INFO L225 Difference]: With dead ends: 71 [2024-11-27 19:56:31,396 INFO L226 Difference]: Without dead ends: 71 [2024-11-27 19:56:31,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-27 19:56:31,397 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 13 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:56:31,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 231 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 19:56:31,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-27 19:56:31,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-27 19:56:31,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.271186440677966) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:31,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2024-11-27 19:56:31,400 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 35 [2024-11-27 19:56:31,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:56:31,401 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2024-11-27 19:56:31,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 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-11-27 19:56:31,401 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2024-11-27 19:56:31,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-27 19:56:31,402 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:56:31,402 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-27 19:56:31,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-27 19:56:31,402 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 19:56:31,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:56:31,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1155959091, now seen corresponding path program 1 times [2024-11-27 19:56:31,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:56:31,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236055619] [2024-11-27 19:56:31,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:31,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:56:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 19:56:31,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:56:31,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236055619] [2024-11-27 19:56:31,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236055619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:56:31,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:56:31,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 19:56:31,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728197548] [2024-11-27 19:56:31,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:56:31,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 19:56:31,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:56:31,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 19:56:31,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-27 19:56:31,847 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 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-11-27 19:56:32,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:56:32,067 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2024-11-27 19:56:32,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 19:56:32,068 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 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 35 [2024-11-27 19:56:32,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:56:32,068 INFO L225 Difference]: With dead ends: 70 [2024-11-27 19:56:32,069 INFO L226 Difference]: Without dead ends: 70 [2024-11-27 19:56:32,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-27 19:56:32,069 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 11 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:56:32,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 225 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 19:56:32,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-27 19:56:32,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-27 19:56:32,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 69 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-11-27 19:56:32,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2024-11-27 19:56:32,074 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 35 [2024-11-27 19:56:32,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:56:32,074 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2024-11-27 19:56:32,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 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-11-27 19:56:32,074 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2024-11-27 19:56:32,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-27 19:56:32,075 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:56:32,075 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-11-27 19:56:32,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-27 19:56:32,075 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 19:56:32,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:56:32,076 INFO L85 PathProgramCache]: Analyzing trace with hash -24361986, now seen corresponding path program 1 times [2024-11-27 19:56:32,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:56:32,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595951039] [2024-11-27 19:56:32,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:32,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:56:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:32,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 19:56:32,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:56:32,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595951039] [2024-11-27 19:56:32,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595951039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:56:32,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:56:32,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 19:56:32,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457056296] [2024-11-27 19:56:32,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:56:32,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 19:56:32,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:56:32,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 19:56:32,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-27 19:56:32,345 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 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-11-27 19:56:32,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:56:32,475 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2024-11-27 19:56:32,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 19:56:32,476 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 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 39 [2024-11-27 19:56:32,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:56:32,476 INFO L225 Difference]: With dead ends: 70 [2024-11-27 19:56:32,476 INFO L226 Difference]: Without dead ends: 70 [2024-11-27 19:56:32,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-27 19:56:32,477 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 13 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:56:32,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 288 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:56:32,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-27 19:56:32,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-27 19:56:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 69 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2024-11-27 19:56:32,482 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 39 [2024-11-27 19:56:32,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:56:32,482 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2024-11-27 19:56:32,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 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-11-27 19:56:32,483 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2024-11-27 19:56:32,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-27 19:56:32,483 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:56:32,483 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-11-27 19:56:32,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-27 19:56:32,484 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 19:56:32,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:56:32,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1117586266, now seen corresponding path program 1 times [2024-11-27 19:56:32,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:56:32,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399598464] [2024-11-27 19:56:32,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:32,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:56:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:33,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-27 19:56:33,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:56:33,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399598464] [2024-11-27 19:56:33,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399598464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:56:33,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:56:33,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 19:56:33,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011074771] [2024-11-27 19:56:33,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:56:33,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 19:56:33,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:56:33,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 19:56:33,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-27 19:56:33,068 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:33,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:56:33,355 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2024-11-27 19:56:33,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 19:56:33,355 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 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 42 [2024-11-27 19:56:33,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:56:33,356 INFO L225 Difference]: With dead ends: 74 [2024-11-27 19:56:33,356 INFO L226 Difference]: Without dead ends: 74 [2024-11-27 19:56:33,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-27 19:56:33,357 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 27 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:56:33,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 214 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 19:56:33,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-27 19:56:33,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-27 19:56:33,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 73 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:33,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2024-11-27 19:56:33,361 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 42 [2024-11-27 19:56:33,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:56:33,361 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2024-11-27 19:56:33,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:33,362 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2024-11-27 19:56:33,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-27 19:56:33,362 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:56:33,362 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-11-27 19:56:33,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-27 19:56:33,363 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 19:56:33,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:56:33,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1117586265, now seen corresponding path program 1 times [2024-11-27 19:56:33,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:56:33,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172963543] [2024-11-27 19:56:33,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:33,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:56:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-27 19:56:33,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:56:33,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172963543] [2024-11-27 19:56:33,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172963543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:56:33,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:56:33,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 19:56:33,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374240839] [2024-11-27 19:56:33,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:56:33,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 19:56:33,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:56:33,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 19:56:33,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-27 19:56:33,709 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:33,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:56:33,892 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2024-11-27 19:56:33,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 19:56:33,893 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 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 42 [2024-11-27 19:56:33,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:56:33,894 INFO L225 Difference]: With dead ends: 73 [2024-11-27 19:56:33,894 INFO L226 Difference]: Without dead ends: 73 [2024-11-27 19:56:33,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-27 19:56:33,895 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 23 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:56:33,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 159 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 19:56:33,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-27 19:56:33,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-27 19:56:33,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 72 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:33,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2024-11-27 19:56:33,898 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 42 [2024-11-27 19:56:33,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:56:33,898 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2024-11-27 19:56:33,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:33,899 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2024-11-27 19:56:33,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-27 19:56:33,899 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:56:33,899 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:56:33,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-27 19:56:33,900 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 19:56:33,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:56:33,900 INFO L85 PathProgramCache]: Analyzing trace with hash -571577224, now seen corresponding path program 1 times [2024-11-27 19:56:33,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:56:33,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267916466] [2024-11-27 19:56:33,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:33,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:56:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:34,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-27 19:56:34,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:56:34,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267916466] [2024-11-27 19:56:34,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267916466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:56:34,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:56:34,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 19:56:34,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572644809] [2024-11-27 19:56:34,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:56:34,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 19:56:34,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:56:34,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 19:56:34,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-27 19:56:34,192 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 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-11-27 19:56:34,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:56:34,329 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2024-11-27 19:56:34,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 19:56:34,330 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 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 45 [2024-11-27 19:56:34,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:56:34,330 INFO L225 Difference]: With dead ends: 73 [2024-11-27 19:56:34,330 INFO L226 Difference]: Without dead ends: 73 [2024-11-27 19:56:34,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-27 19:56:34,331 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 24 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:56:34,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 284 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:56:34,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-27 19:56:34,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-27 19:56:34,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 72 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:34,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2024-11-27 19:56:34,334 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 45 [2024-11-27 19:56:34,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:56:34,334 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2024-11-27 19:56:34,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 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-11-27 19:56:34,334 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2024-11-27 19:56:34,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-27 19:56:34,335 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:56:34,335 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:56:34,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-27 19:56:34,335 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 19:56:34,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:56:34,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1834657434, now seen corresponding path program 1 times [2024-11-27 19:56:34,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:56:34,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3391171] [2024-11-27 19:56:34,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:34,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:56:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:36,249 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 19:56:36,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:56:36,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3391171] [2024-11-27 19:56:36,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3391171] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:56:36,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202263145] [2024-11-27 19:56:36,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:36,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:56:36,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:56:36,251 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:56:36,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 19:56:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:36,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-27 19:56:36,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:56:36,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 19:56:36,733 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-27 19:56:36,734 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-11-27 19:56:37,179 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 17 treesize of output 13 [2024-11-27 19:56:37,188 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 17 treesize of output 13 [2024-11-27 19:56:37,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:56:37,549 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 30 treesize of output 17 [2024-11-27 19:56:37,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:56:37,588 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 30 treesize of output 17 [2024-11-27 19:56:37,777 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:56:37,779 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:56:37,780 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 60 treesize of output 33 [2024-11-27 19:56:37,789 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:56:37,791 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:56:37,791 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 61 treesize of output 34 [2024-11-27 19:56:37,965 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:56:37,966 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 54 treesize of output 34 [2024-11-27 19:56:37,983 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:56:37,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:56:37,986 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 10 [2024-11-27 19:56:38,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:56:38,255 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 31 treesize of output 21 [2024-11-27 19:56:38,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:56:38,270 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 19 treesize of output 15 [2024-11-27 19:56:38,625 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 19:56:38,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:56:39,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:56:39,796 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 128 treesize of output 132 [2024-11-27 19:56:40,046 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (and (forall ((v_ArrVal_1522 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_16| Int) (v_ArrVal_1518 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_dll_prepend_~head#1.offset| v_ArrVal_1522)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_16|) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1518) .cse1) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_16| 4)) (+ |c_ULTIMATE.start_dll_prepend_#t~mem10#1.offset| 5)) (< |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| v_ArrVal_1522) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_16| 0))) (forall ((v_prenex_2 Int) (v_prenex_1 Int) (v_prenex_3 (Array Int Int))) (or (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_prenex_3) .cse1) (+ v_prenex_2 4)))) (< |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| v_prenex_1) (< v_prenex_2 0) (< (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_dll_prepend_~head#1.offset| v_prenex_1)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) v_prenex_2))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_16| Int) (v_ArrVal_1517 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1517) .cse1) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_16| 4)) |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|) (forall ((v_ArrVal_1522 Int)) (or (< (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_dll_prepend_~head#1.offset| v_ArrVal_1522)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_16|) (< |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| v_ArrVal_1522))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_16| 0))))) is different from false [2024-11-27 19:56:40,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:56:40,675 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 44 treesize of output 45 [2024-11-27 19:56:40,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:56:40,694 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 92 treesize of output 91 [2024-11-27 19:56:40,703 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 33 treesize of output 29 [2024-11-27 19:56:40,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:56:40,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2024-11-27 19:56:40,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:56:40,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:56:40,878 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 84 treesize of output 68 [2024-11-27 19:56:40,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-11-27 19:56:41,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:56:41,019 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 42 treesize of output 43 [2024-11-27 19:56:41,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:56:41,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:56:41,042 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 88 treesize of output 72 [2024-11-27 19:56:41,052 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 31 treesize of output 27 [2024-11-27 19:56:43,347 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 155 treesize of output 143 [2024-11-27 19:56:43,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 145 treesize of output 125 [2024-11-27 19:56:43,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:56:43,372 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 162 treesize of output 150 [2024-11-27 19:56:43,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:56:43,408 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 177 treesize of output 169 [2024-11-27 19:56:44,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 19:56:44,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202263145] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 19:56:44,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 19:56:44,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 54 [2024-11-27 19:56:44,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155039780] [2024-11-27 19:56:44,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 19:56:44,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-27 19:56:44,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:56:44,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-27 19:56:44,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2688, Unknown=6, NotChecked=104, Total=2970 [2024-11-27 19:56:44,131 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 55 states, 54 states have (on average 2.3518518518518516) internal successors, (127), 55 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:48,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:56:48,546 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2024-11-27 19:56:48,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-27 19:56:48,547 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.3518518518518516) internal successors, (127), 55 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-27 19:56:48,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:56:48,548 INFO L225 Difference]: With dead ends: 82 [2024-11-27 19:56:48,548 INFO L226 Difference]: Without dead ends: 82 [2024-11-27 19:56:48,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=352, Invalid=4758, Unknown=6, NotChecked=140, Total=5256 [2024-11-27 19:56:48,550 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 149 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:56:48,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 944 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1510 Invalid, 0 Unknown, 70 Unchecked, 2.2s Time] [2024-11-27 19:56:48,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-27 19:56:48,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2024-11-27 19:56:48,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 77 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:48,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2024-11-27 19:56:48,554 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 47 [2024-11-27 19:56:48,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:56:48,554 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2024-11-27 19:56:48,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.3518518518518516) internal successors, (127), 55 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:48,555 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2024-11-27 19:56:48,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-27 19:56:48,555 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:56:48,555 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:56:48,568 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-27 19:56:48,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:56:48,760 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 19:56:48,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:56:48,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1834657435, now seen corresponding path program 1 times [2024-11-27 19:56:48,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:56:48,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827504245] [2024-11-27 19:56:48,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:48,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:56:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:50,448 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-27 19:56:50,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:56:50,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827504245] [2024-11-27 19:56:50,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827504245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:56:50,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033591377] [2024-11-27 19:56:50,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:50,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:56:50,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:56:50,450 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:56:50,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-27 19:56:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:50,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-27 19:56:50,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:56:50,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 19:56:50,876 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-27 19:56:50,876 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-11-27 19:56:51,160 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 17 treesize of output 13 [2024-11-27 19:56:51,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:56:51,379 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 30 treesize of output 17 [2024-11-27 19:56:51,486 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:56:51,487 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 58 treesize of output 31 [2024-11-27 19:56:51,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 19:56:51,636 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:56:51,636 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 49 treesize of output 33 [2024-11-27 19:56:51,642 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:56:51,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:56:51,646 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 28 [2024-11-27 19:56:51,770 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-11-27 19:56:51,823 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 19:56:51,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:56:51,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2024-11-27 19:56:52,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:56:52,150 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 56 treesize of output 96 [2024-11-27 19:56:52,334 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse6 (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1698 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1698))) (or (= (select (select .cse0 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse1) |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|) (= (select (select .cse0 .cse2) (+ 4 v_arrayElimCell_51)) |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|)))) (or (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1698 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1698))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse1))) (or (= .cse3 |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|) (= .cse3 (select (select .cse4 .cse2) (+ 4 v_arrayElimCell_51))))))) (not .cse5) (not .cse6)) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1698 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1698))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse1)) (.cse8 (select (select .cse9 .cse2) (+ 4 v_arrayElimCell_51)))) (or (= .cse7 |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|) (= .cse7 .cse8) (= .cse8 |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|))))) (or (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1698 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1698))) (let ((.cse11 (select (select .cse10 .cse2) (+ 4 v_arrayElimCell_51)))) (or (= (select (select .cse10 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse1) .cse11) (= .cse11 |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|))))) (and .cse5 .cse6)))) is different from false [2024-11-27 19:56:52,400 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse1 (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (and (or (not .cse0) (not .cse1) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1698 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_1698))) (let ((.cse4 (select (select .cse2 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse6))) (or (= (select (select .cse2 .cse3) (+ 4 v_arrayElimCell_51)) .cse4) (= .cse5 .cse4)))))) (or (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1698 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_1698))) (let ((.cse7 (select (select .cse8 .cse3) (+ 4 v_arrayElimCell_51)))) (or (= .cse7 (select (select .cse8 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse6)) (= .cse7 .cse5))))) (and .cse0 .cse1)) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1698 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_1698))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse6)) (.cse9 (select (select .cse11 .cse3) (+ 4 v_arrayElimCell_51)))) (or (= .cse9 .cse10) (= .cse5 .cse10) (= .cse9 .cse5))))) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1698 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_1698))) (or (= .cse5 (select (select .cse12 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse6)) (= (select (select .cse12 .cse3) (+ 4 v_arrayElimCell_51)) .cse5)))))) is different from false [2024-11-27 19:56:52,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:56:52,591 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 118 treesize of output 88 [2024-11-27 19:56:52,605 INFO L349 Elim1Store]: treesize reduction 4, result has 73.3 percent of original size [2024-11-27 19:56:52,605 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 226 treesize of output 183 [2024-11-27 19:56:52,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:56:52,622 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 132 treesize of output 116 [2024-11-27 19:56:52,700 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-27 19:56:52,700 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 84 treesize of output 1 [2024-11-27 19:56:52,707 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-27 19:56:52,708 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 65 treesize of output 1 [2024-11-27 19:56:52,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:56:52,717 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 88 treesize of output 68 [2024-11-27 19:56:52,721 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:56:52,738 INFO L349 Elim1Store]: treesize reduction 4, result has 73.3 percent of original size [2024-11-27 19:56:52,738 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 121 treesize of output 94 [2024-11-27 19:56:52,747 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 43 treesize of output 35 [2024-11-27 19:56:53,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:56:53,029 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 21 treesize of output 21 [2024-11-27 19:56:53,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 19:56:53,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033591377] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 19:56:53,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 19:56:53,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 46 [2024-11-27 19:56:53,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879307482] [2024-11-27 19:56:53,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 19:56:53,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-27 19:56:53,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:56:53,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-27 19:56:53,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1844, Unknown=2, NotChecked=174, Total=2162 [2024-11-27 19:56:53,387 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 47 states, 46 states have (on average 2.5434782608695654) internal successors, (117), 47 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-11-27 19:56:55,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:56:55,275 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2024-11-27 19:56:55,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-27 19:56:55,275 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.5434782608695654) internal successors, (117), 47 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) Word has length 47 [2024-11-27 19:56:55,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:56:55,276 INFO L225 Difference]: With dead ends: 82 [2024-11-27 19:56:55,276 INFO L226 Difference]: Without dead ends: 82 [2024-11-27 19:56:55,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=287, Invalid=3259, Unknown=2, NotChecked=234, Total=3782 [2024-11-27 19:56:55,279 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 94 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-27 19:56:55,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 707 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1150 Invalid, 0 Unknown, 131 Unchecked, 0.9s Time] [2024-11-27 19:56:55,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-27 19:56:55,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2024-11-27 19:56:55,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:55,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2024-11-27 19:56:55,283 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 47 [2024-11-27 19:56:55,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:56:55,283 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2024-11-27 19:56:55,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.5434782608695654) internal successors, (117), 47 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-11-27 19:56:55,283 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2024-11-27 19:56:55,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-27 19:56:55,284 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:56:55,284 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:56:55,295 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-27 19:56:55,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-27 19:56:55,485 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 19:56:55,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:56:55,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1039813471, now seen corresponding path program 1 times [2024-11-27 19:56:55,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:56:55,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013874257] [2024-11-27 19:56:55,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:55,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:56:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:56,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-27 19:56:56,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:56:56,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013874257] [2024-11-27 19:56:56,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013874257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:56:56,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:56:56,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-27 19:56:56,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121951795] [2024-11-27 19:56:56,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:56:56,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-27 19:56:56,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:56:56,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-27 19:56:56,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-27 19:56:56,542 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:57,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:56:57,004 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2024-11-27 19:56:57,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-27 19:56:57,005 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 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 48 [2024-11-27 19:56:57,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:56:57,006 INFO L225 Difference]: With dead ends: 82 [2024-11-27 19:56:57,006 INFO L226 Difference]: Without dead ends: 82 [2024-11-27 19:56:57,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-27 19:56:57,007 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 31 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 19:56:57,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 428 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 19:56:57,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-27 19:56:57,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2024-11-27 19:56:57,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:57,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-11-27 19:56:57,010 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 48 [2024-11-27 19:56:57,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:56:57,011 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-11-27 19:56:57,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:56:57,011 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-11-27 19:56:57,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-27 19:56:57,011 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:56:57,012 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:56:57,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-27 19:56:57,012 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 19:56:57,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:56:57,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1476643564, now seen corresponding path program 1 times [2024-11-27 19:56:57,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:56:57,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931249284] [2024-11-27 19:56:57,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:57,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:56:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:58,596 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 19:56:58,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:56:58,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931249284] [2024-11-27 19:56:58,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931249284] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:56:58,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217607331] [2024-11-27 19:56:58,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:56:58,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:56:58,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:56:58,601 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:56:58,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-27 19:56:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:56:58,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-27 19:56:58,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:56:58,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 19:56:59,074 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-27 19:56:59,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-27 19:56:59,362 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 17 treesize of output 13 [2024-11-27 19:56:59,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:56:59,589 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 30 treesize of output 17 [2024-11-27 19:56:59,635 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:56:59,636 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 53 treesize of output 26 [2024-11-27 19:56:59,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 19:56:59,756 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:56:59,757 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 40 treesize of output 24 [2024-11-27 19:56:59,762 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:56:59,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:56:59,765 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 10 [2024-11-27 19:56:59,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:56:59,945 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-11-27 19:57:00,034 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 19:57:00,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:57:00,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-27 19:57:00,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:57:00,912 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 39 treesize of output 40 [2024-11-27 19:57:00,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:57:00,929 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 83 treesize of output 82 [2024-11-27 19:57:00,936 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 54 treesize of output 50 [2024-11-27 19:57:00,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:57:00,999 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 31 treesize of output 32 [2024-11-27 19:57:01,016 INFO L349 Elim1Store]: treesize reduction 12, result has 20.0 percent of original size [2024-11-27 19:57:01,016 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 59 treesize of output 46 [2024-11-27 19:57:01,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-11-27 19:57:01,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:57:01,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-27 19:57:01,059 INFO L349 Elim1Store]: treesize reduction 12, result has 20.0 percent of original size [2024-11-27 19:57:01,060 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 59 treesize of output 46 [2024-11-27 19:57:01,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-11-27 19:57:01,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:57:01,592 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 33 [2024-11-27 19:57:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 19:57:02,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217607331] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 19:57:02,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 19:57:02,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20] total 47 [2024-11-27 19:57:02,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932134758] [2024-11-27 19:57:02,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 19:57:02,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-27 19:57:02,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:57:02,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-27 19:57:02,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1996, Unknown=21, NotChecked=0, Total=2162 [2024-11-27 19:57:02,106 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 47 states, 47 states have (on average 2.5531914893617023) internal successors, (120), 47 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-11-27 19:57:04,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:57:04,458 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2024-11-27 19:57:04,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-27 19:57:04,459 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.5531914893617023) internal successors, (120), 47 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 50 [2024-11-27 19:57:04,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:57:04,460 INFO L225 Difference]: With dead ends: 78 [2024-11-27 19:57:04,460 INFO L226 Difference]: Without dead ends: 78 [2024-11-27 19:57:04,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=277, Invalid=3362, Unknown=21, NotChecked=0, Total=3660 [2024-11-27 19:57:04,461 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 115 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:57:04,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 945 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-27 19:57:04,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-27 19:57:04,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-27 19:57:04,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 77 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:57:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2024-11-27 19:57:04,467 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 50 [2024-11-27 19:57:04,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:57:04,468 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2024-11-27 19:57:04,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.5531914893617023) internal successors, (120), 47 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-11-27 19:57:04,468 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2024-11-27 19:57:04,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-27 19:57:04,469 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:57:04,469 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2024-11-27 19:57:04,482 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-27 19:57:04,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-27 19:57:04,670 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 19:57:04,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:57:04,670 INFO L85 PathProgramCache]: Analyzing trace with hash -589501734, now seen corresponding path program 2 times [2024-11-27 19:57:04,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:57:04,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442788914] [2024-11-27 19:57:04,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 19:57:04,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:57:04,754 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 19:57:04,754 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 19:57:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:57:08,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:57:08,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442788914] [2024-11-27 19:57:08,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442788914] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:57:08,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306440317] [2024-11-27 19:57:08,391 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 19:57:08,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:57:08,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:57:08,393 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:57:08,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-27 19:57:08,740 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 19:57:08,740 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 19:57:08,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 125 conjuncts are in the unsatisfiable core [2024-11-27 19:57:08,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:57:08,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-27 19:57:08,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 19:57:09,021 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 19:57:09,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-27 19:57:09,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-27 19:57:09,192 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-11-27 19:57:09,201 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-11-27 19:57:09,311 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 19 treesize of output 18 [2024-11-27 19:57:09,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-27 19:57:09,470 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 19:57:09,471 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 59 treesize of output 52 [2024-11-27 19:57:09,481 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 31 treesize of output 16 [2024-11-27 19:57:09,873 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-27 19:57:09,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-27 19:57:09,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-11-27 19:57:10,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-27 19:57:10,088 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 31 treesize of output 20 [2024-11-27 19:57:10,126 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 50 treesize of output 33 [2024-11-27 19:57:10,142 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 31 treesize of output 20 [2024-11-27 19:57:10,167 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 31 treesize of output 20 [2024-11-27 19:57:10,192 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 50 treesize of output 33 [2024-11-27 19:57:10,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2024-11-27 19:57:10,827 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 59 treesize of output 42 [2024-11-27 19:57:11,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:57:11,465 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:57:11,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:57:11,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 62 [2024-11-27 19:57:11,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:57:11,499 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:57:11,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:57:11,501 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:57:11,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 34 [2024-11-27 19:57:11,773 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:57:11,774 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 195 treesize of output 139 [2024-11-27 19:57:11,782 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:57:11,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:57:11,787 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 137 treesize of output 104 [2024-11-27 19:57:12,074 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:57:12,075 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 42 treesize of output 30 [2024-11-27 19:57:12,083 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:57:12,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:57:12,086 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 14 [2024-11-27 19:57:13,132 INFO L349 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2024-11-27 19:57:13,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 124 treesize of output 70 [2024-11-27 19:57:13,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:57:13,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 21 [2024-11-27 19:57:13,745 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:57:13,745 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:57:57,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:57:57,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 185 [2024-11-27 19:57:57,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:57:57,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 110 [2024-11-27 19:57:58,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:57:58,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 327 treesize of output 315 [2024-11-27 19:57:58,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:57:58,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 204 [2024-11-27 19:58:12,017 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 427 treesize of output 379 [2024-11-27 19:58:12,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:58:12,079 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 696 treesize of output 624 [2024-11-27 19:58:12,098 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 628 treesize of output 570 [2024-11-27 19:58:12,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:58:12,183 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 1054 treesize of output 972 [2024-11-27 19:58:32,044 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse27 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 1)) (.cse12 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse6 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) (.cse10 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 8))) (and (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2154 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse5 (select .cse11 |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse3 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse4 (store .cse11 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse5 .cse10 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (.cse0 (let ((.cse9 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse9 |c_ULTIMATE.start_dll_create_#res#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse10 v_ArrVal_2166)))) (.cse7 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (let ((.cse1 (select .cse5 .cse6))) (< (+ (select (select .cse0 .cse1) .cse2) 7) (select .cse3 (select (select .cse4 .cse1) .cse2)))) (not (= (select v_arrayElimArr_14 .cse7) |c_ULTIMATE.start_dll_create_#res#1.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (let ((.cse8 (select (select .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse7))) (< (+ 7 (select (select .cse0 .cse8) .cse2)) (select .cse3 (select (select .cse4 .cse8) .cse2)))) (< v_ArrVal_2154 12) (< |c_ULTIMATE.start_dll_create_#res#1.offset| (select v_arrayElimArr_13 .cse7)) (< (select (select .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))) .cse12) (or .cse12 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse13 (let ((.cse16 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (store .cse16 |c_ULTIMATE.start_dll_create_#res#1.base| (store (select .cse16 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse10 v_prenex_9)))) (.cse15 (+ v_prenex_11 4))) (or (< 0 (+ (select (select .cse13 (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse14 |c_ULTIMATE.start_dll_create_#res#1.base| (store (select .cse14 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse10 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse15)) (+ v_prenex_10 4)) 5)) (not (= (select v_arrayElimArr_12 .cse15) |c_ULTIMATE.start_dll_create_#res#1.base|)) (< |c_ULTIMATE.start_dll_create_#res#1.offset| (select v_arrayElimArr_11 .cse15)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_prenex_10 0) (< (select (select .cse13 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse15) v_prenex_10))))) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_prenex_10 Int)) (or (< v_prenex_10 0) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse23 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (let ((.cse17 (select .cse23 |c_ULTIMATE.start_dll_create_#res#1.base|))) (or (< (select .cse17 .cse6) v_prenex_10) (forall ((v_prenex_11 Int)) (let ((.cse21 (+ v_prenex_11 4))) (or (forall ((v_arrayElimArr_12 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (let ((.cse18 (store .cse23 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse17 .cse10 v_prenex_9))) (.cse20 (select .cse19 |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse22 (+ v_prenex_10 4))) (or (< 0 (+ (select (select .cse18 (select (select (store .cse19 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse20 .cse10 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse21)) .cse22) 5)) (not (= (select v_arrayElimArr_12 .cse21) |c_ULTIMATE.start_dll_create_#res#1.base|)) (< 0 (+ (select (select .cse18 (select .cse20 .cse6)) .cse22) 5)))))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| (select v_arrayElimArr_11 .cse21))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_prenex_10 Int)) (or (< v_prenex_10 0) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse25 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_dll_create_#res#1.base|))) (or (forall ((v_prenex_11 Int)) (let ((.cse24 (+ v_prenex_11 4))) (or (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse24) |c_ULTIMATE.start_dll_create_#res#1.base|)) (< 0 (+ (select (select (store .cse25 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse26 .cse10 v_prenex_9)) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6)) (+ v_prenex_10 4)) 5)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| (select v_arrayElimArr_11 .cse24))))) (< (select .cse26 .cse6) v_prenex_10)))))))))) .cse27) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse29 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse28 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse37 (select v_arrayElimArr_14 .cse29))) (let ((.cse30 (store .cse28 .cse37 (store (select .cse28 .cse37) .cse10 v_ArrVal_2166))) (.cse33 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse32 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse34 (let ((.cse36 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse36 .cse37 (store (select .cse36 .cse37) .cse10 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< (select (select .cse28 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< |c_ULTIMATE.start_dll_create_#res#1.offset| (select v_arrayElimArr_13 .cse29)) (let ((.cse31 (select (select .cse34 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse29))) (< (+ 7 (select (select .cse30 .cse31) .cse32)) (select .cse33 (select (select .cse34 .cse31) .cse32)))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6))) (< (+ 7 (select (select .cse30 .cse35) .cse32)) (select .cse33 (select (select .cse34 .cse35) .cse32))))))))) (< v_ArrVal_2154 12))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse42 (+ v_prenex_11 4))) (let ((.cse38 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse44 (select v_arrayElimArr_12 .cse42))) (let ((.cse39 (store .cse38 .cse44 (store (select .cse38 .cse44) .cse10 v_prenex_9))) (.cse40 (let ((.cse43 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse43 .cse44 (store (select .cse43 .cse44) .cse10 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))) (.cse41 (+ v_prenex_10 4))) (or (< (select (select .cse38 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6) v_prenex_10) (< 0 (+ 5 (select (select .cse39 (select (select .cse40 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6)) .cse41))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| (select v_arrayElimArr_11 .cse42)) (< v_prenex_10 0) (< 0 (+ 5 (select (select .cse39 (select (select .cse40 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse42)) .cse41)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse45 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse48 (+ v_prenex_11 4))) (or (< (select (select .cse45 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6) v_prenex_10) (< 0 (+ 5 (select (let ((.cse46 (select v_arrayElimArr_12 .cse48))) (select (store .cse45 .cse46 (store (select .cse45 .cse46) .cse10 v_prenex_9)) (select (select (let ((.cse47 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse47 .cse46 (store (select .cse47 .cse46) .cse10 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6))) (+ v_prenex_10 4)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| (select v_arrayElimArr_11 .cse48)) (< v_prenex_10 0)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse53 (+ v_prenex_11 4))) (let ((.cse49 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse52 (select v_arrayElimArr_12 .cse53))) (let ((.cse50 (store .cse49 .cse52 (store (select .cse49 .cse52) .cse10 v_prenex_9)))) (or (< (select (select .cse49 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6) v_prenex_10) (< 0 (+ 5 (select (select .cse50 (select (select (let ((.cse51 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse51 .cse52 (store (select .cse51 .cse52) .cse10 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6)) (+ v_prenex_10 4)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| (select v_arrayElimArr_11 .cse53)) (< v_prenex_10 0) (< (select (select .cse50 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse53) v_prenex_10)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (< v_ArrVal_2154 12) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse55 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse56 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse61 (select v_arrayElimArr_14 .cse55))) (let ((.cse54 (store .cse56 .cse61 (store (select .cse56 .cse61) .cse10 v_ArrVal_2166)))) (or (< (select (select .cse54 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse55) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< (select (select .cse56 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< |c_ULTIMATE.start_dll_create_#res#1.offset| (select v_arrayElimArr_13 .cse55)) (let ((.cse59 (let ((.cse60 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse60 .cse61 (store (select .cse60 .cse61) .cse10 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (let ((.cse57 (select (select .cse59 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6)) (.cse58 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select .cse54 .cse57) .cse58)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select .cse59 .cse57) .cse58)))))))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_ArrVal_2154 Int)) (or (< v_ArrVal_2154 12) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse62 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse63 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< (select (select .cse62 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< |c_ULTIMATE.start_dll_create_#res#1.offset| (select v_arrayElimArr_13 .cse63)) (let ((.cse64 (select v_arrayElimArr_14 .cse63))) (let ((.cse67 (let ((.cse68 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse68 .cse64 (store (select .cse68 .cse64) .cse10 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (let ((.cse65 (select (select .cse67 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6)) (.cse66 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select (store .cse62 .cse64 (store (select .cse62 .cse64) .cse10 v_ArrVal_2166)) .cse65) .cse66)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select .cse67 .cse65) .cse66))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse70 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse71 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse78 (select v_arrayElimArr_14 .cse70))) (let ((.cse69 (store .cse71 .cse78 (store (select .cse71 .cse78) .cse10 v_ArrVal_2166))) (.cse74 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse73 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse75 (let ((.cse77 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse77 .cse78 (store (select .cse77 .cse78) .cse10 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (or (< (select (select .cse69 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse70) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< (select (select .cse71 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< |c_ULTIMATE.start_dll_create_#res#1.offset| (select v_arrayElimArr_13 .cse70)) (let ((.cse72 (select (select .cse75 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse70))) (< (+ 7 (select (select .cse69 .cse72) .cse73)) (select .cse74 (select (select .cse75 .cse72) .cse73)))) (let ((.cse76 (select (select .cse75 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6))) (< (+ 7 (select (select .cse69 .cse76) .cse73)) (select .cse74 (select (select .cse75 .cse76) .cse73))))))))) (< v_ArrVal_2154 12))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse82 (+ v_prenex_11 4))) (let ((.cse79 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse84 (select v_arrayElimArr_12 .cse82))) (let ((.cse83 (store .cse79 .cse84 (store (select .cse79 .cse84) .cse10 v_prenex_9))) (.cse80 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12)) (.cse81 (+ v_prenex_10 4))) (or (< (select (select .cse79 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6) v_prenex_10) (< 0 (+ 5 (select (select .cse79 (select (select .cse80 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6)) .cse81))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| (select v_arrayElimArr_11 .cse82)) (< v_prenex_10 0) (< (select (select .cse83 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse82) v_prenex_10) (< 0 (+ 5 (select (select .cse83 (select (select (store .cse80 .cse84 (store (select .cse80 .cse84) .cse10 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse82)) .cse81)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0))))) .cse27) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int)) (let ((.cse86 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (let ((.cse87 (select .cse86 |c_ULTIMATE.start_dll_create_#res#1.base|))) (or (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse85 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| (select v_arrayElimArr_13 .cse85)) (forall ((v_arrayElimArr_14 (Array Int Int))) (or (let ((.cse90 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse91 (select .cse90 |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse88 (select .cse91 .cse6)) (.cse89 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ (select (select (store .cse86 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse87 .cse10 v_ArrVal_2166)) .cse88) .cse89) 7) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select (store .cse90 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse91 .cse10 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) .cse88) .cse89)))))) (not (= (select v_arrayElimArr_14 .cse85) |c_ULTIMATE.start_dll_create_#res#1.base|))))))) (< (select .cse87 .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int)) (let ((.cse102 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (let ((.cse92 (select .cse102 |c_ULTIMATE.start_dll_create_#res#1.base|))) (or (< (select .cse92 .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse99 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (forall ((v_arrayElimArr_14 (Array Int Int))) (let ((.cse101 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse98 (select .cse101 |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse93 (store .cse102 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse92 .cse10 v_ArrVal_2166))) (.cse96 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse95 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse97 (store .cse101 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse98 .cse10 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))) (or (let ((.cse94 (select .cse98 .cse6))) (< (+ (select (select .cse93 .cse94) .cse95) 7) (select .cse96 (select (select .cse97 .cse94) .cse95)))) (not (= (select v_arrayElimArr_14 .cse99) |c_ULTIMATE.start_dll_create_#res#1.base|)) (let ((.cse100 (select (select .cse97 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse99))) (< (+ 7 (select (select .cse93 .cse100) .cse95)) (select .cse96 (select (select .cse97 .cse100) .cse95))))))))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| (select v_arrayElimArr_13 .cse99))))))))))) (< v_ArrVal_2154 12)))))) .cse27) (or .cse27 (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2154 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse110 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (let ((.cse108 (select .cse110 |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse103 (store .cse110 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse108 .cse10 v_ArrVal_2166))) (.cse109 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (let ((.cse106 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse107 (select .cse106 |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse104 (select .cse107 .cse6)) (.cse105 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ (select (select .cse103 .cse104) .cse105) 7) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select (store .cse106 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse107 .cse10 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) .cse104) .cse105)))))) (< (select .cse108 .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (not (= (select v_arrayElimArr_14 .cse109) |c_ULTIMATE.start_dll_create_#res#1.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_ArrVal_2154 12) (< |c_ULTIMATE.start_dll_create_#res#1.offset| (select v_arrayElimArr_13 .cse109)) (< (select (select .cse103 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse109) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse114 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (let ((.cse111 (select .cse114 |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse113 (store .cse114 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse111 .cse10 v_prenex_9))) (.cse112 (+ v_prenex_11 4))) (or (< (select .cse111 .cse6) v_prenex_10) (not (= (select v_arrayElimArr_12 .cse112) |c_ULTIMATE.start_dll_create_#res#1.base|)) (< |c_ULTIMATE.start_dll_create_#res#1.offset| (select v_arrayElimArr_11 .cse112)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< 0 (+ (select (select .cse113 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6)) (+ v_prenex_10 4)) 5)) (< v_prenex_10 0) (< (select (select .cse113 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse112) v_prenex_10)))))) .cse27) (or .cse12 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse120 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse116 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (let ((.cse117 (select .cse116 |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse119 (+ v_prenex_10 4)) (.cse115 (store .cse120 |c_ULTIMATE.start_dll_create_#res#1.base| (store (select .cse120 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse10 v_prenex_9))) (.cse118 (+ v_prenex_11 4))) (or (< 0 (+ (select (select .cse115 (select (select (store .cse116 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse117 .cse10 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse118)) .cse119) 5)) (< 0 (+ 5 (select (select .cse120 (select .cse117 .cse6)) .cse119))) (not (= (select v_arrayElimArr_12 .cse118) |c_ULTIMATE.start_dll_create_#res#1.base|)) (< |c_ULTIMATE.start_dll_create_#res#1.offset| (select v_arrayElimArr_11 .cse118)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_prenex_10 0) (< (select (select .cse115 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse118) v_prenex_10)))))) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse123 (+ v_prenex_11 4))) (let ((.cse126 (select v_arrayElimArr_12 .cse123)) (.cse127 (+ v_arrayElimCell_128 8))) (let ((.cse122 (let ((.cse128 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse128 .cse126 (store (select .cse128 .cse126) .cse127 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))) (.cse124 (+ v_prenex_10 4)) (.cse121 (let ((.cse125 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (store .cse125 .cse126 (store (select .cse125 .cse126) .cse127 v_prenex_9))))) (or (< 0 (+ (select (select .cse121 (select (select .cse122 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse123)) .cse124) 5)) (< 0 (+ (select (select .cse121 (select (select .cse122 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6)) .cse124) 5)) (< (select (select .cse121 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6) v_prenex_10) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse123))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse130 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse135 (select v_arrayElimArr_14 .cse130)) (.cse136 (+ v_arrayElimCell_128 8))) (let ((.cse129 (let ((.cse137 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse137 .cse135 (store (select .cse137 .cse135) .cse136 v_ArrVal_2166))))) (or (< (select (select .cse129 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse130) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse130)) (let ((.cse133 (let ((.cse134 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse134 .cse135 (store (select .cse134 .cse135) .cse136 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (let ((.cse131 (select (select .cse133 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6)) (.cse132 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select .cse129 .cse131) .cse132)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select .cse133 .cse131) .cse132))))) (< (select (select .cse129 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (< v_ArrVal_2154 12) (forall ((v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int)) (let ((.cse147 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse149 (+ v_arrayElimCell_128 8))) (let ((.cse148 (store (select .cse147 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse149 v_ArrVal_2166))) (or (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse138 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse138)) (forall ((v_arrayElimArr_14 (Array Int Int))) (let ((.cse146 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse144 (store (select .cse146 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse149 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (let ((.cse139 (store .cse147 |c_ULTIMATE.start_dll_create_#res#1.base| .cse148)) (.cse142 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse141 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse143 (store .cse146 |c_ULTIMATE.start_dll_create_#res#1.base| .cse144))) (or (not (= (select v_arrayElimArr_14 .cse138) |c_ULTIMATE.start_dll_create_#res#1.base|)) (let ((.cse140 (select .cse144 .cse6))) (< (+ 7 (select (select .cse139 .cse140) .cse141)) (select .cse142 (select (select .cse143 .cse140) .cse141)))) (let ((.cse145 (select (select .cse143 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse138))) (< (+ 7 (select (select .cse139 .cse145) .cse141)) (select .cse142 (select (select .cse143 .cse145) .cse141)))))))))))) (< (select .cse148 .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_ArrVal_2154 Int)) (or (< v_ArrVal_2154 12) (forall ((v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (forall ((v_arrayElimArr_14 (Array Int Int)) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse150 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (forall ((v_arrayElimArr_13 (Array Int Int))) (or (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse150)) (forall ((v_ArrVal_2166 Int)) (let ((.cse160 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse159 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14)) (.cse161 (+ v_arrayElimCell_128 8))) (let ((.cse156 (store (select .cse159 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse161 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) (.cse157 (store (select .cse160 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse161 v_ArrVal_2166))) (let ((.cse151 (store .cse160 |c_ULTIMATE.start_dll_create_#res#1.base| .cse157)) (.cse154 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse153 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse155 (store .cse159 |c_ULTIMATE.start_dll_create_#res#1.base| .cse156))) (or (< (select (select .cse151 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse150) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (let ((.cse152 (select .cse156 .cse6))) (< (+ 7 (select (select .cse151 .cse152) .cse153)) (select .cse154 (select (select .cse155 .cse152) .cse153)))) (< (select .cse157 .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (let ((.cse158 (select (select .cse155 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse150))) (< (+ 7 (select (select .cse151 .cse158) .cse153)) (select .cse154 (select (select .cse155 .cse158) .cse153))))))))))) (not (= (select v_arrayElimArr_14 .cse150) |c_ULTIMATE.start_dll_create_#res#1.base|))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse162 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse169 (+ v_arrayElimCell_128 8))) (let ((.cse168 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12)) (.cse165 (store (select .cse162 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse169 v_prenex_9))) (let ((.cse166 (store .cse162 |c_ULTIMATE.start_dll_create_#res#1.base| .cse165)) (.cse163 (store (select .cse168 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse169 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) (.cse167 (+ v_prenex_11 4)) (.cse164 (+ v_prenex_10 4))) (or (< 0 (+ 5 (select (select .cse162 (select .cse163 .cse6)) .cse164))) (< (select .cse165 .cse6) v_prenex_10) (< (select (select .cse166 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse167) v_prenex_10) (not (= (select v_arrayElimArr_12 .cse167) |c_ULTIMATE.start_dll_create_#res#1.base|)) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse167)) (< 0 (+ 5 (select (select .cse166 (select (select (store .cse168 |c_ULTIMATE.start_dll_create_#res#1.base| .cse163) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse167)) .cse164)))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_ArrVal_2154 Int)) (or (< v_ArrVal_2154 12) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse178 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse176 (+ v_arrayElimCell_128 8))) (let ((.cse177 (store (select .cse178 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse176 v_ArrVal_2166))) (let ((.cse171 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) (.cse170 (store .cse178 |c_ULTIMATE.start_dll_create_#res#1.base| .cse177))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< (select (select .cse170 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse171) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse171)) (not (= (select v_arrayElimArr_14 .cse171) |c_ULTIMATE.start_dll_create_#res#1.base|)) (let ((.cse174 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse175 (store (select .cse174 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse176 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (let ((.cse172 (select .cse175 .cse6)) (.cse173 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select .cse170 .cse172) .cse173)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select (store .cse174 |c_ULTIMATE.start_dll_create_#res#1.base| .cse175) .cse172) .cse173)))))) (< (select .cse177 .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse183 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse180 (+ v_arrayElimCell_128 8))) (let ((.cse181 (store (select .cse183 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse180 v_prenex_9))) (let ((.cse179 (store .cse183 |c_ULTIMATE.start_dll_create_#res#1.base| .cse181)) (.cse182 (+ v_prenex_11 4))) (or (< 0 (+ 5 (select (select .cse179 (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse180 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse6)) (+ v_prenex_10 4)))) (< (select .cse181 .cse6) v_prenex_10) (< (select (select .cse179 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse182) v_prenex_10) (not (= (select v_arrayElimArr_12 .cse182) |c_ULTIMATE.start_dll_create_#res#1.base|)) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse182))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse188 (+ v_prenex_11 4))) (let ((.cse186 (select v_arrayElimArr_12 .cse188)) (.cse187 (+ v_arrayElimCell_128 8))) (let ((.cse184 (let ((.cse189 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (store .cse189 .cse186 (store (select .cse189 .cse186) .cse187 v_prenex_9))))) (or (< 0 (+ (select (select .cse184 (select (select (let ((.cse185 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse185 .cse186 (store (select .cse185 .cse186) .cse187 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6)) (+ v_prenex_10 4)) 5)) (< (select (select .cse184 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6) v_prenex_10) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse188))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse192 (+ v_prenex_11 4))) (let ((.cse194 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse196 (select v_arrayElimArr_12 .cse192)) (.cse197 (+ v_arrayElimCell_128 8))) (let ((.cse190 (store .cse194 .cse196 (store (select .cse194 .cse196) .cse197 v_prenex_9))) (.cse191 (let ((.cse195 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse195 .cse196 (store (select .cse195 .cse196) .cse197 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))) (.cse193 (+ v_prenex_10 4))) (or (< 0 (+ (select (select .cse190 (select (select .cse191 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse192)) .cse193) 5)) (< (select (select .cse190 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse192) v_prenex_10) (< (select (select .cse190 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6) v_prenex_10) (< v_prenex_10 0) (< 0 (+ 5 (select (select .cse194 (select (select .cse191 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6)) .cse193))) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse192))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse202 (+ v_prenex_11 4))) (let ((.cse200 (select v_arrayElimArr_12 .cse202)) (.cse201 (+ v_arrayElimCell_128 8))) (let ((.cse198 (let ((.cse203 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (store .cse203 .cse200 (store (select .cse203 .cse200) .cse201 v_prenex_9))))) (or (< 0 (+ (select (select .cse198 (select (select (let ((.cse199 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse199 .cse200 (store (select .cse199 .cse200) .cse201 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6)) (+ v_prenex_10 4)) 5)) (< (select (select .cse198 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse202) v_prenex_10) (< (select (select .cse198 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6) v_prenex_10) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse202))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse204 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse210 (select v_arrayElimArr_14 .cse204)) (.cse211 (+ v_arrayElimCell_128 8))) (let ((.cse205 (let ((.cse212 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse212 .cse210 (store (select .cse212 .cse210) .cse211 v_ArrVal_2166))))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse204)) (let ((.cse208 (let ((.cse209 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse209 .cse210 (store (select .cse209 .cse210) .cse211 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (let ((.cse206 (select (select .cse208 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6)) (.cse207 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select .cse205 .cse206) .cse207)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select .cse208 .cse206) .cse207))))) (< (select (select .cse205 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))) (< v_ArrVal_2154 12))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int)) (let ((.cse215 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse220 (+ v_arrayElimCell_128 8))) (let ((.cse213 (store (select .cse215 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse220 v_ArrVal_2166))) (or (< (select .cse213 .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse214 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse214)) (forall ((v_arrayElimArr_14 (Array Int Int))) (or (not (= (select v_arrayElimArr_14 .cse214) |c_ULTIMATE.start_dll_create_#res#1.base|)) (let ((.cse218 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse219 (store (select .cse218 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse220 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (let ((.cse216 (select .cse219 .cse6)) (.cse217 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select (store .cse215 |c_ULTIMATE.start_dll_create_#res#1.base| .cse213) .cse216) .cse217)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select (store .cse218 |c_ULTIMATE.start_dll_create_#res#1.base| .cse219) .cse216) .cse217))))))))))))))))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse221 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse229 (select v_arrayElimArr_14 .cse221)) (.cse230 (+ v_arrayElimCell_128 8))) (let ((.cse225 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse224 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse226 (let ((.cse231 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse231 .cse229 (store (select .cse231 .cse229) .cse230 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))) (.cse222 (let ((.cse228 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse228 .cse229 (store (select .cse228 .cse229) .cse230 v_ArrVal_2166))))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse221)) (let ((.cse223 (select (select .cse226 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6))) (< (+ 7 (select (select .cse222 .cse223) .cse224)) (select .cse225 (select (select .cse226 .cse223) .cse224)))) (let ((.cse227 (select (select .cse226 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse221))) (< (+ 7 (select (select .cse222 .cse227) .cse224)) (select .cse225 (select (select .cse226 .cse227) .cse224)))) (< (select (select .cse222 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse232 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse234 (+ v_arrayElimCell_128 8))) (let ((.cse233 (store (select .cse232 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse234 v_prenex_9)) (.cse235 (+ v_prenex_11 4))) (or (< 0 (+ 5 (select (select (store .cse232 |c_ULTIMATE.start_dll_create_#res#1.base| .cse233) (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse234 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse6)) (+ v_prenex_10 4)))) (< (select .cse233 .cse6) v_prenex_10) (not (= (select v_arrayElimArr_12 .cse235) |c_ULTIMATE.start_dll_create_#res#1.base|)) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse235)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (< v_ArrVal_2154 12) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse237 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse244 (select v_arrayElimArr_14 .cse237)) (.cse245 (+ v_arrayElimCell_128 8))) (let ((.cse240 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse239 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse241 (let ((.cse246 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse246 .cse244 (store (select .cse246 .cse244) .cse245 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))) (.cse236 (let ((.cse243 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse243 .cse244 (store (select .cse243 .cse244) .cse245 v_ArrVal_2166))))) (or (< (select (select .cse236 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse237) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse237)) (let ((.cse238 (select (select .cse241 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6))) (< (+ 7 (select (select .cse236 .cse238) .cse239)) (select .cse240 (select (select .cse241 .cse238) .cse239)))) (let ((.cse242 (select (select .cse241 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse237))) (< (+ 7 (select (select .cse236 .cse242) .cse239)) (select .cse240 (select (select .cse241 .cse242) .cse239)))) (< (select (select .cse236 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse254 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse253 (+ v_arrayElimCell_128 8))) (let ((.cse252 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12)) (.cse250 (store (select .cse254 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse253 v_prenex_9))) (let ((.cse247 (store .cse254 |c_ULTIMATE.start_dll_create_#res#1.base| .cse250)) (.cse248 (store (select .cse252 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse253 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) (.cse251 (+ v_prenex_11 4)) (.cse249 (+ v_prenex_10 4))) (or (< 0 (+ 5 (select (select .cse247 (select .cse248 .cse6)) .cse249))) (< (select .cse250 .cse6) v_prenex_10) (not (= (select v_arrayElimArr_12 .cse251) |c_ULTIMATE.start_dll_create_#res#1.base|)) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse251)) (< 0 (+ 5 (select (select .cse247 (select (select (store .cse252 |c_ULTIMATE.start_dll_create_#res#1.base| .cse248) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse251)) .cse249))))))))))) .cse27) (or .cse12 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse261 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (let ((.cse260 (select .cse261 |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse256 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (let ((.cse257 (select .cse256 |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse259 (+ v_prenex_10 4)) (.cse255 (store .cse261 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse260 .cse10 v_prenex_9))) (.cse258 (+ v_prenex_11 4))) (or (< 0 (+ (select (select .cse255 (select (select (store .cse256 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse257 .cse10 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse258)) .cse259) 5)) (< (select .cse260 .cse6) v_prenex_10) (< 0 (+ 5 (select (select .cse261 (select .cse257 .cse6)) .cse259))) (not (= (select v_arrayElimArr_12 .cse258) |c_ULTIMATE.start_dll_create_#res#1.base|)) (< |c_ULTIMATE.start_dll_create_#res#1.offset| (select v_arrayElimArr_11 .cse258)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_prenex_10 0) (< (select (select .cse255 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse258) v_prenex_10))))))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2154 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse263 (let ((.cse268 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse268 |c_ULTIMATE.start_dll_create_#res#1.base| (store (select .cse268 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse10 v_ArrVal_2166)))) (.cse262 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (not (= (select v_arrayElimArr_14 .cse262) |c_ULTIMATE.start_dll_create_#res#1.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (let ((.cse266 (let ((.cse267 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse267 |c_ULTIMATE.start_dll_create_#res#1.base| (store (select .cse267 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse10 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (let ((.cse264 (select (select .cse266 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse262)) (.cse265 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select .cse263 .cse264) .cse265)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select .cse266 .cse264) .cse265))))) (< v_ArrVal_2154 12) (< |c_ULTIMATE.start_dll_create_#res#1.offset| (select v_arrayElimArr_13 .cse262)) (< (select (select .cse263 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse262) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))) .cse12) (or .cse12 (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2154 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse279 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14)) (.cse278 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (let ((.cse275 (select .cse278 |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse274 (select .cse279 |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse272 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse271 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse273 (store .cse279 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse274 .cse10 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (.cse269 (store .cse278 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse275 .cse10 v_ArrVal_2166))) (.cse276 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (let ((.cse270 (select .cse274 .cse6))) (< (+ (select (select .cse269 .cse270) .cse271) 7) (select .cse272 (select (select .cse273 .cse270) .cse271)))) (< (select .cse275 .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (not (= (select v_arrayElimArr_14 .cse276) |c_ULTIMATE.start_dll_create_#res#1.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (let ((.cse277 (select (select .cse273 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse276))) (< (+ 7 (select (select .cse269 .cse277) .cse271)) (select .cse272 (select (select .cse273 .cse277) .cse271)))) (< v_ArrVal_2154 12) (< |c_ULTIMATE.start_dll_create_#res#1.offset| (select v_arrayElimArr_13 .cse276)) (< (select (select .cse269 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse276) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))))))) is different from true [2024-11-27 19:58:40,740 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse32 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse7 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (.cse10 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 1))) (and (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2154 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse9 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse0 (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse8 .cse6 v_ArrVal_2166))) (.cse1 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< (select (select .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (not (= (select v_arrayElimArr_14 .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse2 (select .cse5 .cse7)) (.cse3 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select .cse0 .cse2) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse5 .cse6 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) .cse2) .cse3)))))) (< (select .cse8 .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_13 .cse1)) (< v_ArrVal_2154 12)))))) .cse10) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_prenex_10 Int)) (or (< v_prenex_10 0) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse12 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (forall ((v_prenex_11 Int)) (let ((.cse11 (+ v_prenex_11 4))) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_11 .cse11)) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse11) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< 0 (+ 5 (select (select (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse13 .cse6 v_prenex_9)) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7)) (+ v_prenex_10 4))))))))) (< (select .cse13 .cse7) v_prenex_10))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_prenex_10 Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse19 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (forall ((v_prenex_11 Int)) (let ((.cse14 (+ v_prenex_11 4))) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_11 .cse14)) (forall ((v_arrayElimArr_12 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (let ((.cse15 (store .cse19 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse20 .cse6 v_prenex_9))) (.cse17 (select .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse18 (+ v_prenex_10 4))) (or (not (= (select v_arrayElimArr_12 .cse14) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< 0 (+ (select (select .cse15 (select (select (store .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse17 .cse6 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse14)) .cse18) 5)) (< 0 (+ 5 (select (select .cse15 (select .cse17 .cse7)) .cse18)))))))))) (< (select .cse20 .cse7) v_prenex_10))))) (< v_prenex_10 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0))))) .cse10) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2154 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse31 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse30 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse27 (select .cse30 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse28 (select .cse31 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse21 (store .cse31 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse28 .cse6 v_ArrVal_2166))) (.cse25 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse24 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse26 (store .cse30 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse27 .cse6 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (.cse22 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< (select (select .cse21 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse22) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (not (= (select v_arrayElimArr_14 .cse22) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (let ((.cse23 (select .cse27 .cse7))) (< (+ 7 (select (select .cse21 .cse23) .cse24)) (select .cse25 (select (select .cse26 .cse23) .cse24)))) (< (select .cse28 .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_13 .cse22)) (< v_ArrVal_2154 12) (let ((.cse29 (select (select .cse26 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse22))) (< (+ (select (select .cse21 .cse29) .cse24) 7) (select .cse25 (select (select .cse26 .cse29) .cse24))))))))) .cse32) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse36 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (let ((.cse35 (select .cse36 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse33 (+ v_prenex_11 4)) (.cse34 (store .cse36 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse35 .cse6 v_prenex_9)))) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_11 .cse33)) (< (select (select .cse34 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse33) v_prenex_10) (not (= (select v_arrayElimArr_12 .cse33) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_prenex_10 0) (< (select .cse35 .cse7) v_prenex_10) (< 0 (+ 5 (select (select .cse34 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7)) (+ v_prenex_10 4))))))))) .cse10) (or .cse32 (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2154 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse37 (let ((.cse43 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse43 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse43 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_2166)))) (.cse38 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< (select (select .cse37 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse38) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (not (= (select v_arrayElimArr_14 .cse38) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_13 .cse38)) (< v_ArrVal_2154 12) (let ((.cse41 (let ((.cse42 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse42 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse42 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (let ((.cse39 (select (select .cse41 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse38)) (.cse40 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ (select (select .cse37 .cse39) .cse40) 7) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select .cse41 .cse39) .cse40))))))))) (or .cse32 (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2154 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse52 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse50 (select .cse52 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse44 (let ((.cse53 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse53 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse53 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_2166)))) (.cse48 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse47 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse49 (store .cse52 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse50 .cse6 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (.cse45 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< (select (select .cse44 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse45) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (not (= (select v_arrayElimArr_14 .cse45) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (let ((.cse46 (select .cse50 .cse7))) (< (+ 7 (select (select .cse44 .cse46) .cse47)) (select .cse48 (select (select .cse49 .cse46) .cse47)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_13 .cse45)) (< v_ArrVal_2154 12) (let ((.cse51 (select (select .cse49 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse45))) (< (+ (select (select .cse44 .cse51) .cse47) 7) (select .cse48 (select (select .cse49 .cse51) .cse47)))))))))) (or .cse32 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse56 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12)) (.cse59 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (let ((.cse55 (store .cse59 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse59 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_prenex_9))) (.cse54 (+ v_prenex_11 4)) (.cse57 (select .cse56 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse58 (+ v_prenex_10 4))) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_11 .cse54)) (< (select (select .cse55 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse54) v_prenex_10) (not (= (select v_arrayElimArr_12 .cse54) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_prenex_10 0) (< 0 (+ (select (select .cse55 (select (select (store .cse56 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse57 .cse6 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse54)) .cse58) 5)) (< 0 (+ 5 (select (select .cse59 (select .cse57 .cse7)) .cse58)))))))) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_ArrVal_2154 Int)) (or (< v_ArrVal_2154 12) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int)) (let ((.cse61 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (let ((.cse62 (select .cse61 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse60 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (forall ((v_arrayElimArr_14 (Array Int Int))) (or (not (= (select v_arrayElimArr_14 .cse60) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (let ((.cse65 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse66 (select .cse65 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse63 (select .cse66 .cse7)) (.cse64 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select (store .cse61 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse62 .cse6 v_ArrVal_2166)) .cse63) .cse64)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select (store .cse65 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse66 .cse6 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) .cse63) .cse64)))))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_13 .cse60))))) (< (select .cse62 .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (< v_ArrVal_2154 12) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int)) (let ((.cse76 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (let ((.cse77 (select .cse76 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse67 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (forall ((v_arrayElimArr_14 (Array Int Int))) (let ((.cse75 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse73 (select .cse75 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse68 (store .cse76 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse77 .cse6 v_ArrVal_2166))) (.cse71 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse70 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse72 (store .cse75 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse73 .cse6 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))) (or (not (= (select v_arrayElimArr_14 .cse67) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (let ((.cse69 (select .cse73 .cse7))) (< (+ 7 (select (select .cse68 .cse69) .cse70)) (select .cse71 (select (select .cse72 .cse69) .cse70)))) (let ((.cse74 (select (select .cse72 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse67))) (< (+ (select (select .cse68 .cse74) .cse70) 7) (select .cse71 (select (select .cse72 .cse74) .cse70))))))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_13 .cse67))))) (< (select .cse77 .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))))))))) .cse10) (or .cse32 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse84 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (let ((.cse81 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12)) (.cse80 (select .cse84 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse79 (store .cse84 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse80 .cse6 v_prenex_9))) (.cse78 (+ v_prenex_11 4)) (.cse82 (select .cse81 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse83 (+ v_prenex_10 4))) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_11 .cse78)) (< (select (select .cse79 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse78) v_prenex_10) (not (= (select v_arrayElimArr_12 .cse78) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_prenex_10 0) (< (select .cse80 .cse7) v_prenex_10) (< 0 (+ (select (select .cse79 (select (select (store .cse81 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse82 .cse6 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse78)) .cse83) 5)) (< 0 (+ 5 (select (select .cse84 (select .cse82 .cse7)) .cse83))))))))) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse85 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse86 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< (select (select .cse85 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_13 .cse86)) (let ((.cse87 (select v_arrayElimArr_14 .cse86))) (let ((.cse90 (let ((.cse91 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse91 .cse87 (store (select .cse91 .cse87) .cse6 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (let ((.cse88 (select (select .cse90 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7)) (.cse89 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select (store .cse85 .cse87 (store (select .cse85 .cse87) .cse6 v_ArrVal_2166)) .cse88) .cse89)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select .cse90 .cse88) .cse89))))))))) (< v_ArrVal_2154 12))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse93 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse92 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse99 (select v_arrayElimArr_14 .cse93))) (let ((.cse94 (store .cse92 .cse99 (store (select .cse92 .cse99) .cse6 v_ArrVal_2166)))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< (select (select .cse92 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_13 .cse93)) (let ((.cse97 (let ((.cse98 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse98 .cse99 (store (select .cse98 .cse99) .cse6 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (let ((.cse95 (select (select .cse97 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7)) (.cse96 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select .cse94 .cse95) .cse96)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select .cse97 .cse95) .cse96))))) (< (select (select .cse94 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse93) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse106 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse100 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse108 (select v_arrayElimArr_14 .cse106))) (let ((.cse104 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse103 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse105 (let ((.cse109 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse109 .cse108 (store (select .cse109 .cse108) .cse6 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))) (.cse101 (store .cse100 .cse108 (store (select .cse100 .cse108) .cse6 v_ArrVal_2166)))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< (select (select .cse100 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (let ((.cse102 (select (select .cse105 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse106))) (< (+ 7 (select (select .cse101 .cse102) .cse103)) (select .cse104 (select (select .cse105 .cse102) .cse103)))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_13 .cse106)) (let ((.cse107 (select (select .cse105 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7))) (< (+ 7 (select (select .cse101 .cse107) .cse103)) (select .cse104 (select (select .cse105 .cse107) .cse103)))) (< (select (select .cse101 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse106) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))) (< v_ArrVal_2154 12))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse111 (+ v_prenex_11 4))) (let ((.cse114 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse113 (select v_arrayElimArr_12 .cse111))) (let ((.cse110 (store .cse114 .cse113 (store (select .cse114 .cse113) .cse6 v_prenex_9)))) (or (< (select (select .cse110 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse111) v_prenex_10) (< 0 (+ 5 (select (select .cse110 (select (select (let ((.cse112 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse112 .cse113 (store (select .cse112 .cse113) .cse6 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7)) (+ v_prenex_10 4)))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_11 .cse111)) (< v_prenex_10 0) (< (select (select .cse114 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7) v_prenex_10)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse118 (+ v_prenex_11 4)) (.cse115 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (or (< 0 (+ 5 (select (let ((.cse116 (select v_arrayElimArr_12 .cse118))) (select (store .cse115 .cse116 (store (select .cse115 .cse116) .cse6 v_prenex_9)) (select (select (let ((.cse117 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse117 .cse116 (store (select .cse117 .cse116) .cse6 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7))) (+ v_prenex_10 4)))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_11 .cse118)) (< v_prenex_10 0) (< (select (select .cse115 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7) v_prenex_10)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse120 (+ v_prenex_11 4))) (let ((.cse124 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse122 (select v_arrayElimArr_12 .cse120))) (let ((.cse119 (store .cse124 .cse122 (store (select .cse124 .cse122) .cse6 v_prenex_9))) (.cse121 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12)) (.cse123 (+ v_prenex_10 4))) (or (< (select (select .cse119 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse120) v_prenex_10) (< 0 (+ (select (select .cse119 (select (select (store .cse121 .cse122 (store (select .cse121 .cse122) .cse6 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse120)) .cse123) 5)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_11 .cse120)) (< v_prenex_10 0) (< (select (select .cse124 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7) v_prenex_10) (< 0 (+ 5 (select (select .cse124 (select (select .cse121 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7)) .cse123)))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse127 (+ v_prenex_11 4))) (let ((.cse129 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse131 (select v_arrayElimArr_12 .cse127))) (let ((.cse125 (store .cse129 .cse131 (store (select .cse129 .cse131) .cse6 v_prenex_9))) (.cse126 (let ((.cse130 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse130 .cse131 (store (select .cse130 .cse131) .cse6 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))) (.cse128 (+ v_prenex_10 4))) (or (< 0 (+ (select (select .cse125 (select (select .cse126 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse127)) .cse128) 5)) (< 0 (+ 5 (select (select .cse125 (select (select .cse126 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7)) .cse128))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_11 .cse127)) (< v_prenex_10 0) (< (select (select .cse129 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7) v_prenex_10)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse138 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse132 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse141 (select v_arrayElimArr_14 .cse138))) (let ((.cse133 (store .cse132 .cse141 (store (select .cse132 .cse141) .cse6 v_ArrVal_2166))) (.cse136 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse135 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse137 (let ((.cse140 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse140 .cse141 (store (select .cse140 .cse141) .cse6 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< (select (select .cse132 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (let ((.cse134 (select (select .cse137 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse138))) (< (+ 7 (select (select .cse133 .cse134) .cse135)) (select .cse136 (select (select .cse137 .cse134) .cse135)))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_13 .cse138)) (let ((.cse139 (select (select .cse137 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7))) (< (+ 7 (select (select .cse133 .cse139) .cse135)) (select .cse136 (select (select .cse137 .cse139) .cse135))))))))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0))))) .cse10) (or .cse32 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse143 (let ((.cse145 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (store .cse145 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse145 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_prenex_9)))) (.cse142 (+ v_prenex_11 4))) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_11 .cse142)) (< (select (select .cse143 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse142) v_prenex_10) (not (= (select v_arrayElimArr_12 .cse142) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_prenex_10 0) (< 0 (+ (select (select .cse143 (select (select (let ((.cse144 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse144 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse144 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse142)) (+ v_prenex_10 4)) 5)))))) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse152 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse153 (+ v_arrayElimCell_128 8))) (let ((.cse148 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12)) (.cse151 (store (select .cse152 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse153 v_prenex_9))) (let ((.cse147 (store .cse152 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse151)) (.cse146 (+ v_prenex_11 4)) (.cse149 (store (select .cse148 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse153 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) (.cse150 (+ v_prenex_10 4))) (or (not (= (select v_arrayElimArr_12 .cse146) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< 0 (+ 5 (select (select .cse147 (select (select (store .cse148 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse149) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse146)) .cse150))) (< v_prenex_10 0) (< (select (select .cse147 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse146) v_prenex_10) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse146)) (< (select .cse151 .cse7) v_prenex_10) (< 0 (+ 5 (select (select .cse152 (select .cse149 .cse7)) .cse150)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse154 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse156 (+ v_arrayElimCell_128 8))) (let ((.cse157 (+ v_prenex_11 4)) (.cse155 (store (select .cse154 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse156 v_prenex_9))) (or (< 0 (+ 5 (select (select (store .cse154 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse155) (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse156 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse7)) (+ v_prenex_10 4)))) (not (= (select v_arrayElimArr_12 .cse157) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse157)) (< (select .cse155 .cse7) v_prenex_10))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse160 (+ v_prenex_11 4))) (let ((.cse162 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse163 (select v_arrayElimArr_12 .cse160)) (.cse164 (+ v_arrayElimCell_128 8))) (let ((.cse159 (let ((.cse165 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse165 .cse163 (store (select .cse165 .cse163) .cse164 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))) (.cse161 (+ v_prenex_10 4)) (.cse158 (store .cse162 .cse163 (store (select .cse162 .cse163) .cse164 v_prenex_9)))) (or (< 0 (+ (select (select .cse158 (select (select .cse159 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse160)) .cse161) 5)) (< (select (select .cse158 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7) v_prenex_10) (< 0 (+ 5 (select (select .cse162 (select (select .cse159 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7)) .cse161))) (< (select (select .cse158 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse160) v_prenex_10) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse160))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse167 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse174 (select v_arrayElimArr_14 .cse167)) (.cse175 (+ v_arrayElimCell_128 8))) (let ((.cse166 (let ((.cse176 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse176 .cse174 (store (select .cse176 .cse174) .cse175 v_ArrVal_2166)))) (.cse170 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse169 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse171 (let ((.cse173 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse173 .cse174 (store (select .cse173 .cse174) .cse175 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (or (< (select (select .cse166 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse167) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse167)) (let ((.cse168 (select (select .cse171 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse167))) (< (+ 7 (select (select .cse166 .cse168) .cse169)) (select .cse170 (select (select .cse171 .cse168) .cse169)))) (< (select (select .cse166 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (let ((.cse172 (select (select .cse171 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7))) (< (+ 7 (select (select .cse166 .cse172) .cse169)) (select .cse170 (select (select .cse171 .cse172) .cse169))))))))) (< v_ArrVal_2154 12))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse177 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse185 (select v_arrayElimArr_14 .cse177)) (.cse186 (+ v_arrayElimCell_128 8))) (let ((.cse178 (let ((.cse187 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse187 .cse185 (store (select .cse187 .cse185) .cse186 v_ArrVal_2166)))) (.cse181 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse180 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse182 (let ((.cse184 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse184 .cse185 (store (select .cse184 .cse185) .cse186 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse177)) (let ((.cse179 (select (select .cse182 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse177))) (< (+ 7 (select (select .cse178 .cse179) .cse180)) (select .cse181 (select (select .cse182 .cse179) .cse180)))) (< (select (select .cse178 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (let ((.cse183 (select (select .cse182 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7))) (< (+ 7 (select (select .cse178 .cse183) .cse180)) (select .cse181 (select (select .cse182 .cse183) .cse180))))))))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse190 (+ v_prenex_11 4))) (let ((.cse193 (select v_arrayElimArr_12 .cse190)) (.cse194 (+ v_arrayElimCell_128 8))) (let ((.cse188 (let ((.cse195 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (store .cse195 .cse193 (store (select .cse195 .cse193) .cse194 v_prenex_9)))) (.cse189 (let ((.cse192 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse192 .cse193 (store (select .cse192 .cse193) .cse194 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))) (.cse191 (+ v_prenex_10 4))) (or (< 0 (+ (select (select .cse188 (select (select .cse189 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse190)) .cse191) 5)) (< (select (select .cse188 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7) v_prenex_10) (< 0 (+ 5 (select (select .cse188 (select (select .cse189 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7)) .cse191))) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse190))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse197 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse202 (select v_arrayElimArr_14 .cse197)) (.cse203 (+ v_arrayElimCell_128 8))) (let ((.cse196 (let ((.cse204 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse204 .cse202 (store (select .cse204 .cse202) .cse203 v_ArrVal_2166))))) (or (< (select (select .cse196 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse197) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse197)) (< (select (select .cse196 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (let ((.cse200 (let ((.cse201 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse201 .cse202 (store (select .cse201 .cse202) .cse203 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (let ((.cse198 (select (select .cse200 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7)) (.cse199 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select .cse196 .cse198) .cse199)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select .cse200 .cse198) .cse199)))))))))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse213 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse210 (+ v_arrayElimCell_128 8))) (let ((.cse212 (store (select .cse213 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse210 v_ArrVal_2166))) (let ((.cse205 (store .cse213 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse212)) (.cse211 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (let ((.cse208 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse209 (store (select .cse208 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse210 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (let ((.cse206 (select .cse209 .cse7)) (.cse207 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select .cse205 .cse206) .cse207)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select (store .cse208 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse209) .cse206) .cse207)))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (not (= (select v_arrayElimArr_14 .cse211) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse211)) (< (select .cse212 .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< (select (select .cse205 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse211) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int)) (let ((.cse216 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse221 (+ v_arrayElimCell_128 8))) (let ((.cse214 (store (select .cse216 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse221 v_ArrVal_2166))) (or (< (select .cse214 .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse215 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse215)) (forall ((v_arrayElimArr_14 (Array Int Int))) (or (let ((.cse219 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse220 (store (select .cse219 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse221 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (let ((.cse217 (select .cse220 .cse7)) (.cse218 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select (store .cse216 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse214) .cse217) .cse218)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select (store .cse219 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse220) .cse217) .cse218)))))) (not (= (select v_arrayElimArr_14 .cse215) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))))))))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse229 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse228 (+ v_arrayElimCell_128 8))) (let ((.cse226 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12)) (.cse227 (store (select .cse229 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse228 v_prenex_9))) (let ((.cse222 (store .cse229 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse227)) (.cse223 (store (select .cse226 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse228 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) (.cse224 (+ v_prenex_10 4)) (.cse225 (+ v_prenex_11 4))) (or (< 0 (+ 5 (select (select .cse222 (select .cse223 .cse7)) .cse224))) (not (= (select v_arrayElimArr_12 .cse225) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< 0 (+ 5 (select (select .cse222 (select (select (store .cse226 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse223) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse225)) .cse224))) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse225)) (< (select .cse227 .cse7) v_prenex_10)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse230 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse236 (select v_arrayElimArr_14 .cse230)) (.cse237 (+ v_arrayElimCell_128 8))) (let ((.cse231 (let ((.cse238 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse238 .cse236 (store (select .cse238 .cse236) .cse237 v_ArrVal_2166))))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse230)) (< (select (select .cse231 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (let ((.cse234 (let ((.cse235 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse235 .cse236 (store (select .cse235 .cse236) .cse237 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (let ((.cse232 (select (select .cse234 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7)) (.cse233 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select .cse231 .cse232) .cse233)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select .cse234 .cse232) .cse233)))))))))) (< v_ArrVal_2154 12))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (forall ((v_arrayElimArr_14 (Array Int Int)) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse239 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (forall ((v_arrayElimArr_13 (Array Int Int))) (or (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse239)) (forall ((v_ArrVal_2166 Int)) (let ((.cse249 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14)) (.cse248 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse250 (+ v_arrayElimCell_128 8))) (let ((.cse246 (store (select .cse248 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse250 v_ArrVal_2166)) (.cse245 (store (select .cse249 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse250 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (let ((.cse243 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse242 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse244 (store .cse249 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse245)) (.cse240 (store .cse248 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse246))) (or (let ((.cse241 (select .cse245 .cse7))) (< (+ 7 (select (select .cse240 .cse241) .cse242)) (select .cse243 (select (select .cse244 .cse241) .cse242)))) (< (select .cse246 .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (let ((.cse247 (select (select .cse244 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse239))) (< (+ (select (select .cse240 .cse247) .cse242) 7) (select .cse243 (select (select .cse244 .cse247) .cse242)))) (< (select (select .cse240 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse239) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))))) (not (= (select v_arrayElimArr_14 .cse239) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (< v_ArrVal_2154 12))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse255 (+ v_prenex_11 4))) (let ((.cse253 (select v_arrayElimArr_12 .cse255)) (.cse254 (+ v_arrayElimCell_128 8))) (let ((.cse251 (let ((.cse256 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (store .cse256 .cse253 (store (select .cse256 .cse253) .cse254 v_prenex_9))))) (or (< (select (select .cse251 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7) v_prenex_10) (< 0 (+ 5 (select (select .cse251 (select (select (let ((.cse252 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse252 .cse253 (store (select .cse252 .cse253) .cse254 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7)) (+ v_prenex_10 4)))) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse255))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse261 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse258 (+ v_arrayElimCell_128 8))) (let ((.cse260 (store (select .cse261 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse258 v_prenex_9))) (let ((.cse257 (store .cse261 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse260)) (.cse259 (+ v_prenex_11 4))) (or (< 0 (+ 5 (select (select .cse257 (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse258 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse7)) (+ v_prenex_10 4)))) (not (= (select v_arrayElimArr_12 .cse259) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< v_prenex_10 0) (< (select (select .cse257 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse259) v_prenex_10) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse259)) (< (select .cse260 .cse7) v_prenex_10)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse266 (+ v_prenex_11 4))) (let ((.cse264 (select v_arrayElimArr_12 .cse266)) (.cse265 (+ v_arrayElimCell_128 8))) (let ((.cse262 (let ((.cse267 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (store .cse267 .cse264 (store (select .cse267 .cse264) .cse265 v_prenex_9))))) (or (< (select (select .cse262 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7) v_prenex_10) (< 0 (+ 5 (select (select .cse262 (select (select (let ((.cse263 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse263 .cse264 (store (select .cse263 .cse264) .cse265 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7)) (+ v_prenex_10 4)))) (< (select (select .cse262 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse266) v_prenex_10) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse266))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int)) (let ((.cse277 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse279 (+ v_arrayElimCell_128 8))) (let ((.cse278 (store (select .cse277 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse279 v_ArrVal_2166))) (or (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse274 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (forall ((v_arrayElimArr_14 (Array Int Int))) (let ((.cse276 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse273 (store (select .cse276 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse279 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (let ((.cse268 (store .cse277 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse278)) (.cse271 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse270 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse272 (store .cse276 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse273))) (or (let ((.cse269 (select .cse273 .cse7))) (< (+ 7 (select (select .cse268 .cse269) .cse270)) (select .cse271 (select (select .cse272 .cse269) .cse270)))) (not (= (select v_arrayElimArr_14 .cse274) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (let ((.cse275 (select (select .cse272 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse274))) (< (+ (select (select .cse268 .cse275) .cse270) 7) (select .cse271 (select (select .cse272 .cse275) .cse270))))))))) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse274))))) (< (select .cse278 .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))))) (< v_ArrVal_2154 12)))))) .cse10))) is different from true [2024-11-27 19:58:53,609 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse60 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse3 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse7 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse59 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 1))) (and (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse0 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) (.cse1 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse0)) (let ((.cse2 (select v_arrayElimArr_14 .cse0))) (let ((.cse6 (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7)) (.cse5 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_2166)) .cse4) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select .cse6 .cse4) .cse5)))))) (< (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse9 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse16 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse17 (select v_arrayElimArr_14 .cse9))) (let ((.cse13 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse12 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse14 (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse18 .cse17 (store (select .cse18 .cse17) .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))) (.cse10 (store .cse16 .cse17 (store (select .cse16 .cse17) .cse3 v_ArrVal_2166)))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse9)) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7))) (< (+ 7 (select (select .cse10 .cse11) .cse12)) (select .cse13 (select (select .cse14 .cse11) .cse12)))) (let ((.cse15 (select (select .cse14 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse9))) (< (+ 7 (select (select .cse10 .cse15) .cse12)) (select .cse13 (select (select .cse14 .cse15) .cse12)))) (< (select (select .cse10 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse9) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< (select (select .cse16 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse19 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse26 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse25 (select v_arrayElimArr_14 .cse19))) (let ((.cse20 (store .cse26 .cse25 (store (select .cse26 .cse25) .cse3 v_ArrVal_2166)))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse19)) (let ((.cse23 (let ((.cse24 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse24 .cse25 (store (select .cse24 .cse25) .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (let ((.cse21 (select (select .cse23 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7)) (.cse22 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select .cse20 .cse21) .cse22)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select .cse23 .cse21) .cse22))))) (< (select (select .cse20 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse19) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< (select (select .cse26 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse27 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse34 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse36 (select v_arrayElimArr_14 .cse27))) (let ((.cse28 (store .cse34 .cse36 (store (select .cse34 .cse36) .cse3 v_ArrVal_2166))) (.cse31 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse30 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse32 (let ((.cse35 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse35 .cse36 (store (select .cse35 .cse36) .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse27)) (let ((.cse29 (select (select .cse32 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7))) (< (+ 7 (select (select .cse28 .cse29) .cse30)) (select .cse31 (select (select .cse32 .cse29) .cse30)))) (let ((.cse33 (select (select .cse32 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse27))) (< (+ 7 (select (select .cse28 .cse33) .cse30)) (select .cse31 (select (select .cse32 .cse33) .cse30)))) (< (select (select .cse34 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse39 (+ v_prenex_11 4))) (let ((.cse41 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse43 (select v_arrayElimArr_12 .cse39))) (let ((.cse37 (store .cse41 .cse43 (store (select .cse41 .cse43) .cse3 v_prenex_9))) (.cse38 (let ((.cse42 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse42 .cse43 (store (select .cse42 .cse43) .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))) (.cse40 (+ v_prenex_10 4))) (or (< 0 (+ 5 (select (select .cse37 (select (select .cse38 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse39)) .cse40))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse39)) (< (select (select .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7) v_prenex_10) (< v_prenex_10 0) (< 0 (+ 5 (select (select .cse37 (select (select .cse38 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7)) .cse40)))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse44 (+ v_prenex_11 4))) (let ((.cse45 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse48 (select v_arrayElimArr_12 .cse44))) (let ((.cse46 (store .cse45 .cse48 (store (select .cse45 .cse48) .cse3 v_prenex_9)))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse44)) (< (select (select .cse45 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7) v_prenex_10) (< v_prenex_10 0) (< 0 (+ 5 (select (select .cse46 (select (select (let ((.cse47 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse47 .cse48 (store (select .cse47 .cse48) .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7)) (+ v_prenex_10 4)))) (< (select (select .cse46 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse44) v_prenex_10)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse52 (+ v_prenex_11 4))) (let ((.cse54 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse51 (select v_arrayElimArr_12 .cse52))) (let ((.cse50 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12)) (.cse53 (+ v_prenex_10 4)) (.cse49 (store .cse54 .cse51 (store (select .cse54 .cse51) .cse3 v_prenex_9)))) (or (< 0 (+ 5 (select (select .cse49 (select (select (store .cse50 .cse51 (store (select .cse50 .cse51) .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse52)) .cse53))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse52)) (< (select (select .cse54 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7) v_prenex_10) (< v_prenex_10 0) (< 0 (+ 5 (select (select .cse54 (select (select .cse50 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7)) .cse53))) (< (select (select .cse49 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse52) v_prenex_10)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse56 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse55 (+ v_prenex_11 4))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse55)) (< (select (select .cse56 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7) v_prenex_10) (< v_prenex_10 0) (< 0 (+ 5 (select (let ((.cse57 (select v_arrayElimArr_12 .cse55))) (select (store .cse56 .cse57 (store (select .cse56 .cse57) .cse3 v_prenex_9)) (select (select (let ((.cse58 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse58 .cse57 (store (select .cse58 .cse57) .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7))) (+ v_prenex_10 4))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0))))) .cse59) (or .cse60 (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2154 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse61 (let ((.cse67 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse67 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse67 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 v_ArrVal_2166)))) (.cse65 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (let ((.cse64 (let ((.cse66 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse66 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse66 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (let ((.cse62 (select (select .cse64 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse65)) (.cse63 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ (select (select .cse61 .cse62) .cse63) 7) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select .cse64 .cse62) .cse63))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse65)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_ArrVal_2154 12) (not (= (select v_arrayElimArr_14 .cse65) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< (select (select .cse61 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse65) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))) (or .cse60 (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2154 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse78 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14)) (.cse77 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (let ((.cse76 (select .cse77 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse75 (select .cse78 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse71 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse72 (store .cse78 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse75 .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (.cse70 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse68 (store .cse77 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse76 .cse3 v_ArrVal_2166))) (.cse73 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (let ((.cse69 (select (select .cse72 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse73))) (< (+ (select (select .cse68 .cse69) .cse70) 7) (select .cse71 (select (select .cse72 .cse69) .cse70)))) (let ((.cse74 (select .cse75 .cse7))) (< (+ 7 (select (select .cse68 .cse74) .cse70)) (select .cse71 (select (select .cse72 .cse74) .cse70)))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse73)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< (select .cse76 .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< v_ArrVal_2154 12) (not (= (select v_arrayElimArr_14 .cse73) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< (select (select .cse68 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse73) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))))) (or .cse60 (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2154 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse88 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse86 (select .cse88 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse82 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse83 (store .cse88 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse86 .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (.cse81 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse79 (let ((.cse87 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse87 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse87 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 v_ArrVal_2166)))) (.cse84 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (let ((.cse80 (select (select .cse83 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse84))) (< (+ (select (select .cse79 .cse80) .cse81) 7) (select .cse82 (select (select .cse83 .cse80) .cse81)))) (let ((.cse85 (select .cse86 .cse7))) (< (+ 7 (select (select .cse79 .cse85) .cse81)) (select .cse82 (select (select .cse83 .cse85) .cse81)))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse84)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_ArrVal_2154 12) (not (= (select v_arrayElimArr_14 .cse84) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< (select (select .cse79 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse84) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse92 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (let ((.cse91 (select .cse92 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse89 (+ v_prenex_11 4)) (.cse90 (store .cse92 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse91 .cse3 v_prenex_9)))) (or (not (= (select v_arrayElimArr_12 .cse89) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< (select (select .cse90 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse89) v_prenex_10) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse89)) (< (select .cse91 .cse7) v_prenex_10) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_prenex_10 0) (< 0 (+ (select (select .cse90 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7)) (+ v_prenex_10 4)) 5))))))) .cse59) (or .cse59 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (< v_ArrVal_2154 12) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int)) (let ((.cse94 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (let ((.cse95 (select .cse94 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse93 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse93)) (forall ((v_arrayElimArr_14 (Array Int Int))) (or (let ((.cse98 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse99 (select .cse98 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse96 (select .cse99 .cse7)) (.cse97 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select (store .cse94 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse95 .cse3 v_ArrVal_2166)) .cse96) .cse97)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select (store .cse98 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse99 .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) .cse96) .cse97)))))) (not (= (select v_arrayElimArr_14 .cse93) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (< (select .cse95 .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (< v_ArrVal_2154 12) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int)) (let ((.cse109 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (let ((.cse110 (select .cse109 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse100 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse100)) (forall ((v_arrayElimArr_14 (Array Int Int))) (let ((.cse108 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse107 (select .cse108 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse101 (store .cse109 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse110 .cse3 v_ArrVal_2166))) (.cse104 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse105 (store .cse108 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse107 .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (.cse103 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (or (let ((.cse102 (select (select .cse105 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse100))) (< (+ (select (select .cse101 .cse102) .cse103) 7) (select .cse104 (select (select .cse105 .cse102) .cse103)))) (let ((.cse106 (select .cse107 .cse7))) (< (+ 7 (select (select .cse101 .cse106) .cse103)) (select .cse104 (select (select .cse105 .cse106) .cse103)))) (not (= (select v_arrayElimArr_14 .cse100) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))))))) (< (select .cse110 .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0))))))))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2154 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse118 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (let ((.cse117 (select .cse118 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse111 (store .cse118 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse117 .cse3 v_ArrVal_2166))) (.cse116 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (let ((.cse114 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse115 (select .cse114 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse112 (select .cse115 .cse7)) (.cse113 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select .cse111 .cse112) .cse113)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select (store .cse114 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse115 .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) .cse112) .cse113)))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse116)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< (select .cse117 .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< v_ArrVal_2154 12) (not (= (select v_arrayElimArr_14 .cse116) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< (select (select .cse111 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse116) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))) .cse59) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_prenex_10 Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse121 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (let ((.cse119 (select .cse121 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (< (select .cse119 .cse7) v_prenex_10) (forall ((v_prenex_11 Int)) (let ((.cse120 (+ v_prenex_11 4))) (or (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse120) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< 0 (+ (select (select (store .cse121 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse119 .cse3 v_prenex_9)) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7)) (+ v_prenex_10 4)) 5)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse120))))))))) (< v_prenex_10 0))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_prenex_10 Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse128 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (let ((.cse122 (select .cse128 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (< (select .cse122 .cse7) v_prenex_10) (forall ((v_prenex_11 Int)) (let ((.cse126 (+ v_prenex_11 4))) (or (forall ((v_arrayElimArr_12 (Array Int Int))) (let ((.cse124 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (let ((.cse123 (store .cse128 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse122 .cse3 v_prenex_9))) (.cse125 (select .cse124 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse127 (+ v_prenex_10 4))) (or (< 0 (+ 5 (select (select .cse123 (select (select (store .cse124 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse125 .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse126)) .cse127))) (not (= (select v_arrayElimArr_12 .cse126) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< 0 (+ (select (select .cse123 (select .cse125 .cse7)) .cse127) 5)))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse126))))))))) (< v_prenex_10 0)))))) .cse59) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse130 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12)) (.cse134 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (let ((.cse129 (store .cse134 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse134 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 v_prenex_9))) (.cse132 (+ v_prenex_11 4)) (.cse131 (select .cse130 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse133 (+ v_prenex_10 4))) (or (< 0 (+ 5 (select (select .cse129 (select (select (store .cse130 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse131 .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse132)) .cse133))) (not (= (select v_arrayElimArr_12 .cse132) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< (select (select .cse129 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse132) v_prenex_10) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse132)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_prenex_10 0) (< 0 (+ 5 (select (select .cse134 (select .cse131 .cse7)) .cse133))))))) .cse60) (or .cse60 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse135 (let ((.cse138 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (store .cse138 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse138 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 v_prenex_9)))) (.cse137 (+ v_prenex_11 4))) (or (< 0 (+ 5 (select (select .cse135 (select (select (let ((.cse136 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse136 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse136 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse137)) (+ v_prenex_10 4)))) (not (= (select v_arrayElimArr_12 .cse137) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< (select (select .cse135 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse137) v_prenex_10) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse137)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_prenex_10 0))))) (or .cse60 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse145 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (let ((.cse140 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12)) (.cse144 (select .cse145 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse139 (store .cse145 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse144 .cse3 v_prenex_9))) (.cse142 (+ v_prenex_11 4)) (.cse141 (select .cse140 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse143 (+ v_prenex_10 4))) (or (< 0 (+ 5 (select (select .cse139 (select (select (store .cse140 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse141 .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse142)) .cse143))) (not (= (select v_arrayElimArr_12 .cse142) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< (select (select .cse139 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse142) v_prenex_10) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse142)) (< (select .cse144 .cse7) v_prenex_10) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_prenex_10 0) (< 0 (+ 5 (select (select .cse145 (select .cse141 .cse7)) .cse143))))))))) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse154 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse152 (+ v_arrayElimCell_128 8))) (let ((.cse153 (store (select .cse154 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse152 v_ArrVal_2166))) (let ((.cse146 (store .cse154 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse153)) (.cse147 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< (select (select .cse146 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse147) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (let ((.cse150 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse151 (store (select .cse150 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse152 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (let ((.cse148 (select .cse151 .cse7)) (.cse149 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select .cse146 .cse148) .cse149)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select (store .cse150 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse151) .cse148) .cse149)))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse147)) (not (= (select v_arrayElimArr_14 .cse147) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< (select .cse153 .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse157 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse162 (+ v_arrayElimCell_128 8))) (let ((.cse156 (store (select .cse157 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse162 v_prenex_9)) (.cse161 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (let ((.cse158 (store (select .cse161 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse162 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) (.cse159 (+ v_prenex_10 4)) (.cse160 (store .cse157 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse156)) (.cse155 (+ v_prenex_11 4))) (or (not (= (select v_arrayElimArr_12 .cse155) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< (select .cse156 .cse7) v_prenex_10) (< 0 (+ 5 (select (select .cse157 (select .cse158 .cse7)) .cse159))) (< 0 (+ 5 (select (select .cse160 (select (select (store .cse161 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse158) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse155)) .cse159))) (< v_prenex_10 0) (< (select (select .cse160 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse155) v_prenex_10) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse155))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse167 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse166 (+ v_arrayElimCell_128 8))) (let ((.cse164 (store (select .cse167 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse166 v_prenex_9))) (let ((.cse165 (store .cse167 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse164)) (.cse163 (+ v_prenex_11 4))) (or (not (= (select v_arrayElimArr_12 .cse163) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< (select .cse164 .cse7) v_prenex_10) (< v_prenex_10 0) (< (select (select .cse165 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse163) v_prenex_10) (< 0 (+ 5 (select (select .cse165 (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse166 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse7)) (+ v_prenex_10 4)))) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse163))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_ArrVal_2154 Int)) (or (< v_ArrVal_2154 12) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse169 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse174 (select v_arrayElimArr_14 .cse169)) (.cse175 (+ v_arrayElimCell_128 8))) (let ((.cse168 (let ((.cse176 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse176 .cse174 (store (select .cse176 .cse174) .cse175 v_ArrVal_2166))))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< (select (select .cse168 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse169)) (let ((.cse172 (let ((.cse173 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse173 .cse174 (store (select .cse173 .cse174) .cse175 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (let ((.cse170 (select (select .cse172 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7)) (.cse171 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ (select (select .cse168 .cse170) .cse171) 7) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select .cse172 .cse170) .cse171)))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse179 (+ v_prenex_11 4))) (let ((.cse182 (select v_arrayElimArr_12 .cse179)) (.cse183 (+ v_arrayElimCell_128 8))) (let ((.cse178 (let ((.cse184 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse184 .cse182 (store (select .cse184 .cse182) .cse183 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))) (.cse180 (+ v_prenex_10 4)) (.cse177 (let ((.cse181 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (store .cse181 .cse182 (store (select .cse181 .cse182) .cse183 v_prenex_9))))) (or (< 0 (+ (select (select .cse177 (select (select .cse178 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse179)) .cse180) 5)) (< 0 (+ 5 (select (select .cse177 (select (select .cse178 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7)) .cse180))) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse179)) (< (select (select .cse177 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7) v_prenex_10)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse192 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse191 (+ v_arrayElimCell_128 8))) (let ((.cse188 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12)) (.cse186 (store (select .cse192 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse191 v_prenex_9))) (let ((.cse187 (store .cse192 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse186)) (.cse189 (store (select .cse188 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse191 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) (.cse190 (+ v_prenex_10 4)) (.cse185 (+ v_prenex_11 4))) (or (not (= (select v_arrayElimArr_12 .cse185) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< (select .cse186 .cse7) v_prenex_10) (< 0 (+ 5 (select (select .cse187 (select (select (store .cse188 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse189) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse185)) .cse190))) (< v_prenex_10 0) (< 0 (+ 5 (select (select .cse187 (select .cse189 .cse7)) .cse190))) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse185))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse195 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse196 (+ v_arrayElimCell_128 8))) (let ((.cse194 (store (select .cse195 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse196 v_prenex_9)) (.cse193 (+ v_prenex_11 4))) (or (not (= (select v_arrayElimArr_12 .cse193) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< (select .cse194 .cse7) v_prenex_10) (< v_prenex_10 0) (< 0 (+ 5 (select (select (store .cse195 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse194) (select (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse196 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse7)) (+ v_prenex_10 4)))) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse193)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse201 (+ v_prenex_11 4))) (let ((.cse199 (select v_arrayElimArr_12 .cse201)) (.cse200 (+ v_arrayElimCell_128 8))) (let ((.cse197 (let ((.cse202 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (store .cse202 .cse199 (store (select .cse202 .cse199) .cse200 v_prenex_9))))) (or (< 0 (+ 5 (select (select .cse197 (select (select (let ((.cse198 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse198 .cse199 (store (select .cse198 .cse199) .cse200 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7)) (+ v_prenex_10 4)))) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse201)) (< (select (select .cse197 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7) v_prenex_10)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse207 (+ v_prenex_11 4))) (let ((.cse205 (select v_arrayElimArr_12 .cse207)) (.cse206 (+ v_arrayElimCell_128 8))) (let ((.cse203 (let ((.cse208 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (store .cse208 .cse205 (store (select .cse208 .cse205) .cse206 v_prenex_9))))) (or (< 0 (+ 5 (select (select .cse203 (select (select (let ((.cse204 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse204 .cse205 (store (select .cse204 .cse205) .cse206 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7)) (+ v_prenex_10 4)))) (< (select (select .cse203 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse207) v_prenex_10) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse207)) (< (select (select .cse203 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7) v_prenex_10)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (forall ((v_arrayElimArr_14 (Array Int Int)) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse210 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (forall ((v_arrayElimArr_13 (Array Int Int))) (or (forall ((v_ArrVal_2166 Int)) (let ((.cse219 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse218 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14)) (.cse220 (+ v_arrayElimCell_128 8))) (let ((.cse216 (store (select .cse218 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse220 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) (.cse217 (store (select .cse219 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse220 v_ArrVal_2166))) (let ((.cse209 (store .cse219 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse217)) (.cse213 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse214 (store .cse218 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse216)) (.cse212 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (or (< (select (select .cse209 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse210) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (let ((.cse211 (select (select .cse214 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse210))) (< (+ 7 (select (select .cse209 .cse211) .cse212)) (select .cse213 (select (select .cse214 .cse211) .cse212)))) (let ((.cse215 (select .cse216 .cse7))) (< (+ 7 (select (select .cse209 .cse215) .cse212)) (select .cse213 (select (select .cse214 .cse215) .cse212)))) (< (select .cse217 .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse210)))) (not (= (select v_arrayElimArr_14 .cse210) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (< v_ArrVal_2154 12))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int)) (let ((.cse221 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse227 (+ v_arrayElimCell_128 8))) (let ((.cse222 (store (select .cse221 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse227 v_ArrVal_2166))) (or (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse228 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (forall ((v_arrayElimArr_14 (Array Int Int))) (or (let ((.cse225 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse226 (store (select .cse225 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse227 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (let ((.cse223 (select .cse226 .cse7)) (.cse224 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select (store .cse221 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse222) .cse223) .cse224)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select (store .cse225 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse226) .cse223) .cse224)))))) (not (= (select v_arrayElimArr_14 .cse228) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse228))))) (< (select .cse222 .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse230 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse237 (select v_arrayElimArr_14 .cse230)) (.cse238 (+ v_arrayElimCell_128 8))) (let ((.cse229 (let ((.cse239 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse239 .cse237 (store (select .cse239 .cse237) .cse238 v_ArrVal_2166)))) (.cse233 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse232 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse234 (let ((.cse236 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse236 .cse237 (store (select .cse236 .cse237) .cse238 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< (select (select .cse229 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse230)) (let ((.cse231 (select (select .cse234 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse230))) (< (+ 7 (select (select .cse229 .cse231) .cse232)) (select .cse233 (select (select .cse234 .cse231) .cse232)))) (let ((.cse235 (select (select .cse234 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7))) (< (+ (select (select .cse229 .cse235) .cse232) 7) (select .cse233 (select (select .cse234 .cse235) .cse232))))))))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse241 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse246 (select v_arrayElimArr_14 .cse241)) (.cse247 (+ v_arrayElimCell_128 8))) (let ((.cse240 (let ((.cse248 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse248 .cse246 (store (select .cse248 .cse246) .cse247 v_ArrVal_2166))))) (or (< (select (select .cse240 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse241) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< (select (select .cse240 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse241)) (let ((.cse244 (let ((.cse245 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse245 .cse246 (store (select .cse245 .cse246) .cse247 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (let ((.cse242 (select (select .cse244 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7)) (.cse243 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ (select (select .cse240 .cse242) .cse243) 7) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select .cse244 .cse242) .cse243)))))))))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_ArrVal_2154 Int)) (or (< v_ArrVal_2154 12) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse250 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse257 (select v_arrayElimArr_14 .cse250)) (.cse258 (+ v_arrayElimCell_128 8))) (let ((.cse249 (let ((.cse259 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse259 .cse257 (store (select .cse259 .cse257) .cse258 v_ArrVal_2166)))) (.cse253 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse252 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse254 (let ((.cse256 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse256 .cse257 (store (select .cse256 .cse257) .cse258 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (or (< (select (select .cse249 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse250) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< (select (select .cse249 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse250)) (let ((.cse251 (select (select .cse254 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse250))) (< (+ 7 (select (select .cse249 .cse251) .cse252)) (select .cse253 (select (select .cse254 .cse251) .cse252)))) (let ((.cse255 (select (select .cse254 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7))) (< (+ (select (select .cse249 .cse255) .cse252) 7) (select .cse253 (select (select .cse254 .cse255) .cse252))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int)) (let ((.cse269 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse271 (+ v_arrayElimCell_128 8))) (let ((.cse270 (store (select .cse269 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse271 v_ArrVal_2166))) (or (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse260 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse260)) (forall ((v_arrayElimArr_14 (Array Int Int))) (let ((.cse268 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse267 (store (select .cse268 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse271 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (let ((.cse261 (store .cse269 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse270)) (.cse264 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse265 (store .cse268 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse267)) (.cse263 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (or (let ((.cse262 (select (select .cse265 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse260))) (< (+ 7 (select (select .cse261 .cse262) .cse263)) (select .cse264 (select (select .cse265 .cse262) .cse263)))) (let ((.cse266 (select .cse267 .cse7))) (< (+ 7 (select (select .cse261 .cse266) .cse263)) (select .cse264 (select (select .cse265 .cse266) .cse263)))) (not (= (select v_arrayElimArr_14 .cse260) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))))))) (< (select .cse270 .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse274 (+ v_prenex_11 4))) (let ((.cse276 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse277 (select v_arrayElimArr_12 .cse274)) (.cse278 (+ v_arrayElimCell_128 8))) (let ((.cse273 (let ((.cse279 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse279 .cse277 (store (select .cse279 .cse277) .cse278 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))) (.cse275 (+ v_prenex_10 4)) (.cse272 (store .cse276 .cse277 (store (select .cse276 .cse277) .cse278 v_prenex_9)))) (or (< 0 (+ (select (select .cse272 (select (select .cse273 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse274)) .cse275) 5)) (< (select (select .cse272 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse274) v_prenex_10) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse274)) (< 0 (+ (select (select .cse276 (select (select .cse273 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7)) .cse275) 5)) (< (select (select .cse272 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7) v_prenex_10)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0))))) .cse59))) is different from true [2024-11-27 19:59:02,533 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 1)) (.cse155 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse12 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (or .cse0 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int)) (let ((.cse13 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (let ((.cse1 (select .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (< (select .cse1 .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse3 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse3)) (forall ((v_arrayElimArr_14 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse4 (store .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 .cse12 v_ArrVal_2166))) (.cse7 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse8 (store .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse10 .cse12 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (.cse6 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (or (let ((.cse5 (select (select .cse8 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse3))) (< (+ (select (select .cse4 .cse5) .cse6) 7) (select .cse7 (select (select .cse8 .cse5) .cse6)))) (not (= (select v_arrayElimArr_14 .cse3) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (let ((.cse9 (select .cse10 .cse2))) (< (+ 7 (select (select .cse4 .cse9) .cse6)) (select .cse7 (select (select .cse8 .cse9) .cse6)))))))))))))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int)) (let ((.cse16 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (let ((.cse14 (select .cse16 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (< (select .cse14 .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse15 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse15)) (forall ((v_arrayElimArr_14 (Array Int Int))) (or (not (= (select v_arrayElimArr_14 .cse15) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (let ((.cse19 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse17 (select .cse20 .cse2)) (.cse18 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select (store .cse16 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse14 .cse12 v_ArrVal_2166)) .cse17) .cse18)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select (store .cse19 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse20 .cse12 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) .cse17) .cse18))))))))))))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0))) (< v_ArrVal_2154 12))))))) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse28 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse27 (+ v_arrayElimCell_128 8))) (let ((.cse25 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12)) (.cse26 (store (select .cse28 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse27 v_prenex_9))) (let ((.cse22 (store .cse28 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse26)) (.cse23 (store (select .cse25 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse27 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) (.cse24 (+ v_prenex_10 4)) (.cse21 (+ v_prenex_11 4))) (or (not (= (select v_arrayElimArr_12 .cse21) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< 0 (+ (select (select .cse22 (select .cse23 .cse2)) .cse24) 5)) (< 0 (+ 5 (select (select .cse22 (select (select (store .cse25 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse23) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse21)) .cse24))) (< (select .cse26 .cse2) v_prenex_10) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse21))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse33 (+ v_prenex_11 4))) (let ((.cse30 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse35 (select v_arrayElimArr_12 .cse33)) (.cse36 (+ v_arrayElimCell_128 8))) (let ((.cse29 (store .cse30 .cse35 (store (select .cse30 .cse35) .cse36 v_prenex_9))) (.cse31 (let ((.cse34 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse34 .cse35 (store (select .cse34 .cse35) .cse36 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))) (.cse32 (+ v_prenex_10 4))) (or (< (select (select .cse29 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) v_prenex_10) (< 0 (+ 5 (select (select .cse30 (select (select .cse31 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) .cse32))) (< (select (select .cse29 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse33) v_prenex_10) (< 0 (+ 5 (select (select .cse29 (select (select .cse31 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse33)) .cse32))) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse33))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (< v_ArrVal_2154 12) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse42 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse45 (select v_arrayElimArr_14 .cse42)) (.cse46 (+ v_arrayElimCell_128 8))) (let ((.cse40 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse39 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse41 (let ((.cse47 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse47 .cse45 (store (select .cse47 .cse45) .cse46 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))) (.cse37 (let ((.cse44 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse44 .cse45 (store (select .cse44 .cse45) .cse46 v_ArrVal_2166))))) (or (let ((.cse38 (select (select .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (< (+ 7 (select (select .cse37 .cse38) .cse39)) (select .cse40 (select (select .cse41 .cse38) .cse39)))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse42)) (let ((.cse43 (select (select .cse41 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse42))) (< (+ (select (select .cse37 .cse43) .cse39) 7) (select .cse40 (select (select .cse41 .cse43) .cse39)))) (< (select (select .cse37 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse53 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse55 (+ v_arrayElimCell_128 8))) (let ((.cse50 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12)) (.cse54 (store (select .cse53 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse55 v_prenex_9))) (let ((.cse49 (store .cse53 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse54)) (.cse51 (store (select .cse50 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse55 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) (.cse52 (+ v_prenex_10 4)) (.cse48 (+ v_prenex_11 4))) (or (not (= (select v_arrayElimArr_12 .cse48) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< 0 (+ 5 (select (select .cse49 (select (select (store .cse50 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse51) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse48)) .cse52))) (< (select (select .cse49 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse48) v_prenex_10) (< 0 (+ (select (select .cse53 (select .cse51 .cse2)) .cse52) 5)) (< (select .cse54 .cse2) v_prenex_10) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse48))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse60 (+ v_prenex_11 4))) (let ((.cse58 (select v_arrayElimArr_12 .cse60)) (.cse59 (+ v_arrayElimCell_128 8))) (let ((.cse56 (let ((.cse61 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (store .cse61 .cse58 (store (select .cse61 .cse58) .cse59 v_prenex_9))))) (or (< (select (select .cse56 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) v_prenex_10) (< 0 (+ 5 (select (select .cse56 (select (select (let ((.cse57 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse57 .cse58 (store (select .cse57 .cse58) .cse59 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) (+ v_prenex_10 4)))) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse60))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse70 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse67 (+ v_arrayElimCell_128 8))) (let ((.cse69 (store (select .cse70 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse67 v_ArrVal_2166))) (let ((.cse62 (store .cse70 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse69)) (.cse68 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (let ((.cse65 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse66 (store (select .cse65 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse67 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (let ((.cse63 (select .cse66 .cse2)) (.cse64 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select .cse62 .cse63) .cse64)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select (store .cse65 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse66) .cse63) .cse64)))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< (select (select .cse62 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse68) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse68)) (< (select .cse69 .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (not (= (select v_arrayElimArr_14 .cse68) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (< v_ArrVal_2154 12))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int)) (let ((.cse81 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse82 (+ v_arrayElimCell_128 8))) (let ((.cse71 (store (select .cse81 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse82 v_ArrVal_2166))) (or (< (select .cse71 .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse78 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (forall ((v_arrayElimArr_14 (Array Int Int))) (let ((.cse80 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse77 (store (select .cse80 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse82 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (let ((.cse72 (store .cse81 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse71)) (.cse75 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse74 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse76 (store .cse80 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse77))) (or (let ((.cse73 (select .cse77 .cse2))) (< (+ 7 (select (select .cse72 .cse73) .cse74)) (select .cse75 (select (select .cse76 .cse73) .cse74)))) (not (= (select v_arrayElimArr_14 .cse78) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (let ((.cse79 (select (select .cse76 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse78))) (< (+ 7 (select (select .cse72 .cse79) .cse74)) (select .cse75 (select (select .cse76 .cse79) .cse74))))))))) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse78))))))))))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse85 (+ v_prenex_11 4))) (let ((.cse88 (select v_arrayElimArr_12 .cse85)) (.cse89 (+ v_arrayElimCell_128 8))) (let ((.cse83 (let ((.cse90 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (store .cse90 .cse88 (store (select .cse90 .cse88) .cse89 v_prenex_9)))) (.cse84 (let ((.cse87 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse87 .cse88 (store (select .cse87 .cse88) .cse89 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))) (.cse86 (+ v_prenex_10 4))) (or (< (select (select .cse83 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) v_prenex_10) (< 0 (+ 5 (select (select .cse83 (select (select .cse84 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse85)) .cse86))) (< 0 (+ 5 (select (select .cse83 (select (select .cse84 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) .cse86))) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse85))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse96 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse99 (select v_arrayElimArr_14 .cse96)) (.cse100 (+ v_arrayElimCell_128 8))) (let ((.cse94 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse93 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse95 (let ((.cse101 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse101 .cse99 (store (select .cse101 .cse99) .cse100 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))) (.cse91 (let ((.cse98 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse98 .cse99 (store (select .cse98 .cse99) .cse100 v_ArrVal_2166))))) (or (let ((.cse92 (select (select .cse95 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (< (+ 7 (select (select .cse91 .cse92) .cse93)) (select .cse94 (select (select .cse95 .cse92) .cse93)))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse96)) (< (select (select .cse91 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse96) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (let ((.cse97 (select (select .cse95 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse96))) (< (+ (select (select .cse91 .cse97) .cse93) 7) (select .cse94 (select (select .cse95 .cse97) .cse93)))) (< (select (select .cse91 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))) (< v_ArrVal_2154 12))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse103 (+ v_prenex_11 4))) (let ((.cse105 (select v_arrayElimArr_12 .cse103)) (.cse106 (+ v_arrayElimCell_128 8))) (let ((.cse102 (let ((.cse107 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (store .cse107 .cse105 (store (select .cse107 .cse105) .cse106 v_prenex_9))))) (or (< (select (select .cse102 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) v_prenex_10) (< (select (select .cse102 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse103) v_prenex_10) (< 0 (+ 5 (select (select .cse102 (select (select (let ((.cse104 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse104 .cse105 (store (select .cse104 .cse105) .cse106 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) (+ v_prenex_10 4)))) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse103))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse112 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse110 (+ v_arrayElimCell_128 8))) (let ((.cse111 (store (select .cse112 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse110 v_prenex_9))) (let ((.cse109 (store .cse112 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse111)) (.cse108 (+ v_prenex_11 4))) (or (not (= (select v_arrayElimArr_12 .cse108) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< 0 (+ (select (select .cse109 (select (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse110 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse2)) (+ v_prenex_10 4)) 5)) (< (select (select .cse109 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse108) v_prenex_10) (< (select .cse111 .cse2) v_prenex_10) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse108))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (forall ((v_arrayElimArr_14 (Array Int Int)) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse113 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (forall ((v_arrayElimArr_13 (Array Int Int))) (or (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse113)) (forall ((v_ArrVal_2166 Int)) (let ((.cse123 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse122 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14)) (.cse124 (+ v_arrayElimCell_128 8))) (let ((.cse119 (store (select .cse122 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse124 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) (.cse120 (store (select .cse123 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse124 v_ArrVal_2166))) (let ((.cse114 (store .cse123 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse120)) (.cse117 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse116 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse118 (store .cse122 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse119))) (or (let ((.cse115 (select .cse119 .cse2))) (< (+ 7 (select (select .cse114 .cse115) .cse116)) (select .cse117 (select (select .cse118 .cse115) .cse116)))) (< (select (select .cse114 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse113) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< (select .cse120 .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (let ((.cse121 (select (select .cse118 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse113))) (< (+ 7 (select (select .cse114 .cse121) .cse116)) (select .cse117 (select (select .cse118 .cse121) .cse116))))))))))) (not (= (select v_arrayElimArr_14 .cse113) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse126 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse128 (+ v_arrayElimCell_128 8))) (let ((.cse127 (store (select .cse126 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse128 v_prenex_9)) (.cse125 (+ v_prenex_11 4))) (or (not (= (select v_arrayElimArr_12 .cse125) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< 0 (+ (select (select (store .cse126 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse127) (select (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse128 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse2)) (+ v_prenex_10 4)) 5)) (< (select .cse127 .cse2) v_prenex_10) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse125)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int)) (let ((.cse129 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse135 (+ v_arrayElimCell_128 8))) (let ((.cse130 (store (select .cse129 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse135 v_ArrVal_2166))) (or (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse136 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (forall ((v_arrayElimArr_14 (Array Int Int))) (or (let ((.cse133 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse134 (store (select .cse133 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse135 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (let ((.cse131 (select .cse134 .cse2)) (.cse132 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select (store .cse129 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse130) .cse131) .cse132)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select (store .cse133 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse134) .cse131) .cse132)))))) (not (= (select v_arrayElimArr_14 .cse136) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse136))))) (< (select .cse130 .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))))) (< v_ArrVal_2154 12))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_ArrVal_2154 Int)) (or (< v_ArrVal_2154 12) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse144 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse142 (select v_arrayElimArr_14 .cse144)) (.cse143 (+ v_arrayElimCell_128 8))) (let ((.cse137 (let ((.cse145 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse145 .cse142 (store (select .cse145 .cse142) .cse143 v_ArrVal_2166))))) (or (let ((.cse140 (let ((.cse141 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse141 .cse142 (store (select .cse141 .cse142) .cse143 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (let ((.cse138 (select (select .cse140 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) (.cse139 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select .cse137 .cse138) .cse139)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select .cse140 .cse138) .cse139))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse144)) (< (select (select .cse137 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse144) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< (select (select .cse137 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse153 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse151 (select v_arrayElimArr_14 .cse153)) (.cse152 (+ v_arrayElimCell_128 8))) (let ((.cse146 (let ((.cse154 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse154 .cse151 (store (select .cse154 .cse151) .cse152 v_ArrVal_2166))))) (or (let ((.cse149 (let ((.cse150 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse150 .cse151 (store (select .cse150 .cse151) .cse152 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (let ((.cse147 (select (select .cse149 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) (.cse148 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select .cse146 .cse147) .cse148)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select .cse149 .cse147) .cse148))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse153)) (< (select (select .cse146 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0))))) .cse0) (or .cse155 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_prenex_10 Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse156 (let ((.cse159 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (store .cse159 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse159 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse12 v_prenex_9)))) (.cse158 (+ v_prenex_11 4))) (or (< 0 (+ (select (select .cse156 (select (select (let ((.cse157 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse157 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse157 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse12 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse158)) (+ v_prenex_10 4)) 5)) (not (= (select v_arrayElimArr_12 .cse158) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse158)) (< (select (select .cse156 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse158) v_prenex_10) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_prenex_10 0))))) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_prenex_10 Int)) (or (< v_prenex_10 0) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse165 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (let ((.cse166 (select .cse165 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (forall ((v_prenex_11 Int)) (let ((.cse160 (+ v_prenex_11 4))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse160)) (forall ((v_arrayElimArr_12 (Array Int Int))) (let ((.cse162 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (let ((.cse161 (store .cse165 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse166 .cse12 v_prenex_9))) (.cse163 (select .cse162 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse164 (+ v_prenex_10 4))) (or (< 0 (+ (select (select .cse161 (select (select (store .cse162 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse163 .cse12 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse160)) .cse164) 5)) (not (= (select v_arrayElimArr_12 .cse160) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< 0 (+ 5 (select (select .cse161 (select .cse163 .cse2)) .cse164)))))))))) (< (select .cse166 .cse2) v_prenex_10))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_prenex_10 Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse168 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (let ((.cse169 (select .cse168 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (forall ((v_prenex_11 Int)) (let ((.cse167 (+ v_prenex_11 4))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse167)) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse167) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< 0 (+ 5 (select (select (store .cse168 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse169 .cse12 v_prenex_9)) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) (+ v_prenex_10 4))))))))) (< (select .cse169 .cse2) v_prenex_10))))) (< v_prenex_10 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0))))) .cse0) (or .cse155 (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2154 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_2152 (Array Int Int)) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse180 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14)) (.cse179 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (let ((.cse176 (select .cse179 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse178 (select .cse180 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse174 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse175 (store .cse180 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse178 .cse12 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (.cse173 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse171 (store .cse179 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse176 .cse12 v_ArrVal_2166))) (.cse170 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse170)) (let ((.cse172 (select (select .cse175 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse170))) (< (+ (select (select .cse171 .cse172) .cse173) 7) (select .cse174 (select (select .cse175 .cse172) .cse173)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< (select .cse176 .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< v_ArrVal_2154 12) (not (= (select v_arrayElimArr_14 .cse170) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (let ((.cse177 (select .cse178 .cse2))) (< (+ 7 (select (select .cse171 .cse177) .cse173)) (select .cse174 (select (select .cse175 .cse177) .cse173)))) (< (select (select .cse171 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse170) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse182 (+ v_prenex_11 4))) (let ((.cse183 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse185 (select v_arrayElimArr_12 .cse182))) (let ((.cse181 (store .cse183 .cse185 (store (select .cse183 .cse185) .cse12 v_prenex_9)))) (or (< (select (select .cse181 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse182) v_prenex_10) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse182)) (< v_prenex_10 0) (< (select (select .cse183 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) v_prenex_10) (< 0 (+ (select (select .cse181 (select (select (let ((.cse184 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse184 .cse185 (store (select .cse184 .cse185) .cse12 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) (+ v_prenex_10 4)) 5))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_ArrVal_2154 Int)) (or (< v_ArrVal_2154 12) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse192 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) (.cse186 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (let ((.cse187 (select v_arrayElimArr_14 .cse192))) (let ((.cse190 (let ((.cse191 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse191 .cse187 (store (select .cse191 .cse187) .cse12 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (let ((.cse188 (select (select .cse190 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) (.cse189 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ (select (select (store .cse186 .cse187 (store (select .cse186 .cse187) .cse12 v_ArrVal_2166)) .cse188) .cse189) 7) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select .cse190 .cse188) .cse189)))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse192)) (< (select (select .cse186 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse198 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse199 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse202 (select v_arrayElimArr_14 .cse198))) (let ((.cse193 (store .cse199 .cse202 (store (select .cse199 .cse202) .cse12 v_ArrVal_2166))) (.cse196 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse195 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse197 (let ((.cse201 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse201 .cse202 (store (select .cse201 .cse202) .cse12 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (let ((.cse194 (select (select .cse197 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (< (+ (select (select .cse193 .cse194) .cse195) 7) (select .cse196 (select (select .cse197 .cse194) .cse195)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse198)) (< (select (select .cse199 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (let ((.cse200 (select (select .cse197 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse198))) (< (+ 7 (select (select .cse193 .cse200) .cse195)) (select .cse196 (select (select .cse197 .cse200) .cse195))))))))) (< v_ArrVal_2154 12))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (< v_ArrVal_2154 12) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse208 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse209 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse212 (select v_arrayElimArr_14 .cse208))) (let ((.cse203 (store .cse209 .cse212 (store (select .cse209 .cse212) .cse12 v_ArrVal_2166))) (.cse206 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse205 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse207 (let ((.cse211 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse211 .cse212 (store (select .cse211 .cse212) .cse12 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (let ((.cse204 (select (select .cse207 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (< (+ (select (select .cse203 .cse204) .cse205) 7) (select .cse206 (select (select .cse207 .cse204) .cse205)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse208)) (< (select (select .cse203 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse208) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< (select (select .cse209 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (let ((.cse210 (select (select .cse207 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse208))) (< (+ 7 (select (select .cse203 .cse210) .cse205)) (select .cse206 (select (select .cse207 .cse210) .cse205))))))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse217 (+ v_prenex_11 4))) (let ((.cse213 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse218 (select v_arrayElimArr_12 .cse217))) (let ((.cse216 (store .cse213 .cse218 (store (select .cse213 .cse218) .cse12 v_prenex_9))) (.cse214 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12)) (.cse215 (+ v_prenex_10 4))) (or (< 0 (+ (select (select .cse213 (select (select .cse214 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) .cse215) 5)) (< (select (select .cse216 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse217) v_prenex_10) (< 0 (+ (select (select .cse216 (select (select (store .cse214 .cse218 (store (select .cse214 .cse218) .cse12 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse217)) .cse215) 5)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse217)) (< v_prenex_10 0) (< (select (select .cse213 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) v_prenex_10)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse220 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse219 (+ v_prenex_11 4))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse219)) (< v_prenex_10 0) (< (select (select .cse220 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) v_prenex_10) (< 0 (+ (select (let ((.cse221 (select v_arrayElimArr_12 .cse219))) (select (store .cse220 .cse221 (store (select .cse220 .cse221) .cse12 v_prenex_9)) (select (select (let ((.cse222 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse222 .cse221 (store (select .cse222 .cse221) .cse12 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (+ v_prenex_10 4)) 5))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse225 (+ v_prenex_11 4))) (let ((.cse227 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse229 (select v_arrayElimArr_12 .cse225))) (let ((.cse223 (store .cse227 .cse229 (store (select .cse227 .cse229) .cse12 v_prenex_9))) (.cse224 (let ((.cse228 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse228 .cse229 (store (select .cse228 .cse229) .cse12 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))) (.cse226 (+ v_prenex_10 4))) (or (< 0 (+ (select (select .cse223 (select (select .cse224 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse225)) .cse226) 5)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse225)) (< v_prenex_10 0) (< (select (select .cse227 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) v_prenex_10) (< 0 (+ (select (select .cse223 (select (select .cse224 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) .cse226) 5))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse236 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse237 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse235 (select v_arrayElimArr_14 .cse236))) (let ((.cse230 (store .cse237 .cse235 (store (select .cse237 .cse235) .cse12 v_ArrVal_2166)))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (let ((.cse233 (let ((.cse234 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse234 .cse235 (store (select .cse234 .cse235) .cse12 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (let ((.cse231 (select (select .cse233 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) (.cse232 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ (select (select .cse230 .cse231) .cse232) 7) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select .cse233 .cse231) .cse232))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse236)) (< (select (select .cse230 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse236) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< (select (select .cse237 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))) (< v_ArrVal_2154 12))))))) (or .cse0 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_prenex_10 Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse241 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (let ((.cse240 (select .cse241 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse239 (store .cse241 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse240 .cse12 v_prenex_9))) (.cse238 (+ v_prenex_11 4))) (or (not (= (select v_arrayElimArr_12 .cse238) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< 0 (+ 5 (select (select .cse239 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) (+ v_prenex_10 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse238)) (< (select (select .cse239 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse238) v_prenex_10) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_prenex_10 0) (< (select .cse240 .cse2) v_prenex_10))))))) (or .cse155 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_prenex_10 Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse247 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse243 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (let ((.cse244 (select .cse243 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse246 (+ v_prenex_10 4)) (.cse242 (store .cse247 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse247 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse12 v_prenex_9))) (.cse245 (+ v_prenex_11 4))) (or (< 0 (+ (select (select .cse242 (select (select (store .cse243 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse244 .cse12 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse245)) .cse246) 5)) (< 0 (+ (select (select .cse247 (select .cse244 .cse2)) .cse246) 5)) (not (= (select v_arrayElimArr_12 .cse245) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse245)) (< (select (select .cse242 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse245) v_prenex_10) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_prenex_10 0)))))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_prenex_10 Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse253 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (let ((.cse254 (select .cse253 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse249 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (let ((.cse250 (select .cse249 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse252 (+ v_prenex_10 4)) (.cse248 (store .cse253 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse254 .cse12 v_prenex_9))) (.cse251 (+ v_prenex_11 4))) (or (< 0 (+ (select (select .cse248 (select (select (store .cse249 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse250 .cse12 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse251)) .cse252) 5)) (< 0 (+ (select (select .cse253 (select .cse250 .cse2)) .cse252) 5)) (not (= (select v_arrayElimArr_12 .cse251) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse251)) (< (select (select .cse248 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse251) v_prenex_10) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_prenex_10 0) (< (select .cse254 .cse2) v_prenex_10)))))) .cse155) (or .cse155 (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2154 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_2152 (Array Int Int)) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse256 (let ((.cse261 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse261 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse261 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse12 v_ArrVal_2166)))) (.cse255 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse255)) (let ((.cse259 (let ((.cse260 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse260 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse260 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse12 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (let ((.cse257 (select (select .cse259 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse255)) (.cse258 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ (select (select .cse256 .cse257) .cse258) 7) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select .cse259 .cse257) .cse258))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_ArrVal_2154 12) (not (= (select v_arrayElimArr_14 .cse255) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< (select (select .cse256 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse255) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2154 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_2152 (Array Int Int)) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse269 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (let ((.cse263 (select .cse269 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse264 (store .cse269 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse263 .cse12 v_ArrVal_2166))) (.cse262 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse262)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< (select .cse263 .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< v_ArrVal_2154 12) (not (= (select v_arrayElimArr_14 .cse262) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (let ((.cse267 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse268 (select .cse267 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse265 (select .cse268 .cse2)) (.cse266 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select .cse264 .cse265) .cse266)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select (store .cse267 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse268 .cse12 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) .cse265) .cse266)))))) (< (select (select .cse264 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse262) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))) .cse0) (or .cse155 (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2154 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_2152 (Array Int Int)) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse279 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (let ((.cse277 (select .cse279 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse274 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse275 (store .cse279 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse277 .cse12 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (.cse273 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse271 (let ((.cse278 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse278 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse278 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse12 v_ArrVal_2166)))) (.cse270 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse270)) (let ((.cse272 (select (select .cse275 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse270))) (< (+ (select (select .cse271 .cse272) .cse273) 7) (select .cse274 (select (select .cse275 .cse272) .cse273)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_ArrVal_2154 12) (not (= (select v_arrayElimArr_14 .cse270) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (let ((.cse276 (select .cse277 .cse2))) (< (+ 7 (select (select .cse271 .cse276) .cse273)) (select .cse274 (select (select .cse275 .cse276) .cse273)))) (< (select (select .cse271 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse270) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))))))) is different from true [2024-11-27 19:59:17,479 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse125 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 1)) (.cse6 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse133 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse9 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5 0)))) (and (or (and (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse7 (+ v_prenex_11 4))) (let ((.cse2 (select v_arrayElimArr_12 .cse7)) (.cse3 (+ v_arrayElimCell_128 8))) (let ((.cse0 (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 v_prenex_9))))) (or (< 0 (+ 5 (select (select .cse0 (select (select (let ((.cse1 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6)) (+ v_prenex_10 4)))) (< (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6) v_prenex_10) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse7))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int)) (let ((.cse15 (+ v_arrayElimCell_128 8))) (let ((.cse11 (store (select (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse15 v_ArrVal_2166))) (or (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse10 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse10)) (forall ((v_arrayElimArr_14 (Array Int Int))) (or (let ((.cse14 (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse15 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (let ((.cse12 (select .cse14 .cse6)) (.cse13 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse11) .cse12) .cse13)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse14) .cse12) .cse13))))) (not (= (select v_arrayElimArr_14 .cse10) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (< (select .cse11 .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0))) (< v_ArrVal_2154 12))))) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse20 (+ v_prenex_11 4))) (let ((.cse16 (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse22 (select v_arrayElimArr_12 .cse20)) (.cse23 (+ v_arrayElimCell_128 8))) (let ((.cse19 (store .cse16 .cse22 (store (select .cse16 .cse22) .cse23 v_prenex_9))) (.cse17 (let ((.cse21 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse21 .cse22 (store (select .cse21 .cse22) .cse23 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))) (.cse18 (+ v_prenex_10 4))) (or (< 0 (+ (select (select .cse16 (select (select .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6)) .cse18) 5)) (< (select (select .cse19 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6) v_prenex_10) (< v_prenex_10 0) (< (select (select .cse19 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse20) v_prenex_10) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse20)) (< 0 (+ (select (select .cse19 (select (select .cse17 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse20)) .cse18) 5))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse24 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse30 (select v_arrayElimArr_14 .cse24)) (.cse31 (+ v_arrayElimCell_128 8))) (let ((.cse25 (let ((.cse32 (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse32 .cse30 (store (select .cse32 .cse30) .cse31 v_ArrVal_2166))))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse24)) (< (select (select .cse25 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse24) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (let ((.cse28 (let ((.cse29 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse29 .cse30 (store (select .cse29 .cse30) .cse31 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (let ((.cse26 (select (select .cse28 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6)) (.cse27 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select .cse25 .cse26) .cse27)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select .cse28 .cse26) .cse27))))) (< (select (select .cse25 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))) (< v_ArrVal_2154 12))))) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse38 (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse39 (+ v_arrayElimCell_128 8))) (let ((.cse37 (store (select .cse38 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse39 v_prenex_9))) (let ((.cse34 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse37)) (.cse33 (+ v_prenex_11 4)) (.cse35 (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse39 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) (.cse36 (+ v_prenex_10 4))) (or (not (= (select v_arrayElimArr_12 .cse33) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< 0 (+ (select (select .cse34 (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse35) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse33)) .cse36) 5)) (< v_prenex_10 0) (< (select .cse37 .cse6) v_prenex_10) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse33)) (< (select (select .cse34 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse33) v_prenex_10) (< 0 (+ (select (select .cse38 (select .cse35 .cse6)) .cse36) 5))))))))) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse43 (+ v_prenex_11 4))) (let ((.cse45 (select v_arrayElimArr_12 .cse43)) (.cse46 (+ v_arrayElimCell_128 8))) (let ((.cse40 (let ((.cse47 (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (store .cse47 .cse45 (store (select .cse47 .cse45) .cse46 v_prenex_9)))) (.cse41 (let ((.cse44 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse44 .cse45 (store (select .cse44 .cse45) .cse46 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))) (.cse42 (+ v_prenex_10 4))) (or (< 0 (+ 5 (select (select .cse40 (select (select .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6)) .cse42))) (< (select (select .cse40 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6) v_prenex_10) (< v_prenex_10 0) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse43)) (< 0 (+ (select (select .cse40 (select (select .cse41 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse43)) .cse42) 5))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (forall ((v_arrayElimArr_14 (Array Int Int)) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse48 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (not (= (select v_arrayElimArr_14 .cse48) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (forall ((v_ArrVal_2166 Int)) (let ((.cse57 (+ v_arrayElimCell_128 8))) (let ((.cse55 (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse57 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) (.cse56 (store (select (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse57 v_ArrVal_2166))) (let ((.cse49 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse56)) (.cse52 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse53 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse55)) (.cse51 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (or (< (select (select .cse49 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse48) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (let ((.cse50 (select (select .cse53 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse48))) (< (+ 7 (select (select .cse49 .cse50) .cse51)) (select .cse52 (select (select .cse53 .cse50) .cse51)))) (let ((.cse54 (select .cse55 .cse6))) (< (+ 7 (select (select .cse49 .cse54) .cse51)) (select .cse52 (select (select .cse53 .cse54) .cse51)))) (< (select .cse56 .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse48))))))))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse63 (+ v_arrayElimCell_128 8))) (let ((.cse64 (store (select (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse63 v_ArrVal_2166))) (let ((.cse58 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse64)) (.cse59 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< (select (select .cse58 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse59) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse59)) (let ((.cse62 (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse63 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (let ((.cse60 (select .cse62 .cse6)) (.cse61 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select .cse58 .cse60) .cse61)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse62) .cse60) .cse61))))) (< (select .cse64 .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (not (= (select v_arrayElimArr_14 .cse59) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse67 (+ v_arrayElimCell_128 8))) (let ((.cse66 (store (select (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse67 v_prenex_9)) (.cse65 (+ v_prenex_11 4))) (or (not (= (select v_arrayElimArr_12 .cse65) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< 0 (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse66) (select (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse67 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse6)) (+ v_prenex_10 4)) 5)) (< v_prenex_10 0) (< (select .cse66 .cse6) v_prenex_10) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse65)))))))) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (< v_ArrVal_2154 12) (forall ((v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int)) (let ((.cse77 (+ v_arrayElimCell_128 8))) (let ((.cse76 (store (select (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse77 v_ArrVal_2166))) (or (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse73 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (forall ((v_arrayElimArr_14 (Array Int Int))) (let ((.cse75 (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse77 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (let ((.cse68 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse76)) (.cse71 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse72 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse75)) (.cse70 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (or (let ((.cse69 (select (select .cse72 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse73))) (< (+ 7 (select (select .cse68 .cse69) .cse70)) (select .cse71 (select (select .cse72 .cse69) .cse70)))) (let ((.cse74 (select .cse75 .cse6))) (< (+ 7 (select (select .cse68 .cse74) .cse70)) (select .cse71 (select (select .cse72 .cse74) .cse70)))) (not (= (select v_arrayElimArr_14 .cse73) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse73))))) (< (select .cse76 .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))))))))) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse80 (+ v_arrayElimCell_128 8))) (let ((.cse81 (store (select (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse80 v_prenex_9))) (let ((.cse79 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse81)) (.cse78 (+ v_prenex_11 4))) (or (not (= (select v_arrayElimArr_12 .cse78) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< 0 (+ (select (select .cse79 (select (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse80 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse6)) (+ v_prenex_10 4)) 5)) (< v_prenex_10 0) (< (select .cse81 .cse6) v_prenex_10) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse78)) (< (select (select .cse79 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse78) v_prenex_10)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse87 (+ v_arrayElimCell_128 8))) (let ((.cse86 (store (select (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse87 v_prenex_9))) (let ((.cse83 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse86)) (.cse84 (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse87 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) (.cse85 (+ v_prenex_10 4)) (.cse82 (+ v_prenex_11 4))) (or (not (= (select v_arrayElimArr_12 .cse82) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< 0 (+ (select (select .cse83 (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse84) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse82)) .cse85) 5)) (< 0 (+ (select (select .cse83 (select .cse84 .cse6)) .cse85) 5)) (< v_prenex_10 0) (< (select .cse86 .cse6) v_prenex_10) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse82))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse88 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse94 (select v_arrayElimArr_14 .cse88)) (.cse95 (+ v_arrayElimCell_128 8))) (let ((.cse89 (let ((.cse96 (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse96 .cse94 (store (select .cse96 .cse94) .cse95 v_ArrVal_2166))))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse88)) (let ((.cse92 (let ((.cse93 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse93 .cse94 (store (select .cse93 .cse94) .cse95 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (let ((.cse90 (select (select .cse92 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6)) (.cse91 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select .cse89 .cse90) .cse91)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select .cse92 .cse90) .cse91))))) (< (select (select .cse89 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))) (< v_ArrVal_2154 12))))) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_arrayElimCell_128 Int) (v_prenex_9 Int)) (let ((.cse101 (+ v_prenex_11 4))) (let ((.cse99 (select v_arrayElimArr_12 .cse101)) (.cse100 (+ v_arrayElimCell_128 8))) (let ((.cse97 (let ((.cse102 (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (store .cse102 .cse99 (store (select .cse102 .cse99) .cse100 v_prenex_9))))) (or (< 0 (+ 5 (select (select .cse97 (select (select (let ((.cse98 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse98 .cse99 (store (select .cse98 .cse99) .cse100 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6)) (+ v_prenex_10 4)))) (< (select (select .cse97 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6) v_prenex_10) (< v_prenex_10 0) (< (select (select .cse97 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse101) v_prenex_10) (< v_arrayElimCell_128 (select v_arrayElimArr_11 .cse101))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse103 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse111 (select v_arrayElimArr_14 .cse103)) (.cse112 (+ v_arrayElimCell_128 8))) (let ((.cse107 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse106 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse108 (let ((.cse113 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse113 .cse111 (store (select .cse113 .cse111) .cse112 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))) (.cse104 (let ((.cse110 (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse110 .cse111 (store (select .cse110 .cse111) .cse112 v_ArrVal_2166))))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse103)) (let ((.cse105 (select (select .cse108 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse103))) (< (+ 7 (select (select .cse104 .cse105) .cse106)) (select .cse107 (select (select .cse108 .cse105) .cse106)))) (let ((.cse109 (select (select .cse108 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6))) (< (+ 7 (select (select .cse104 .cse109) .cse106)) (select .cse107 (select (select .cse108 .cse109) .cse106)))) (< (select (select .cse104 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_128 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse114 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse122 (select v_arrayElimArr_14 .cse114)) (.cse123 (+ v_arrayElimCell_128 8))) (let ((.cse118 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse117 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse119 (let ((.cse124 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse124 .cse122 (store (select .cse124 .cse122) .cse123 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))) (.cse115 (let ((.cse121 (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13))) (store .cse121 .cse122 (store (select .cse121 .cse122) .cse123 v_ArrVal_2166))))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< v_arrayElimCell_128 (select v_arrayElimArr_13 .cse114)) (let ((.cse116 (select (select .cse119 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse114))) (< (+ 7 (select (select .cse115 .cse116) .cse117)) (select .cse118 (select (select .cse119 .cse116) .cse117)))) (< (select (select .cse115 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse114) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (let ((.cse120 (select (select .cse119 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6))) (< (+ 7 (select (select .cse115 .cse120) .cse117)) (select .cse118 (select (select .cse119 .cse120) .cse117)))) (< (select (select .cse115 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))) (< v_ArrVal_2154 12)))))) .cse125) (or (and (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_prenex_10 Int)) (or (< v_prenex_10 0) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse130 (select (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (forall ((v_prenex_11 Int)) (let ((.cse126 (+ v_prenex_11 4))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse126)) (forall ((v_arrayElimArr_12 (Array Int Int))) (let ((.cse127 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse130 .cse5 v_prenex_9))) (.cse128 (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse129 (+ v_prenex_10 4))) (or (< 0 (+ (select (select .cse127 (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse128 .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse126)) .cse129) 5)) (not (= (select v_arrayElimArr_12 .cse126) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< 0 (+ (select (select .cse127 (select .cse128 .cse6)) .cse129) 5)))))))) (< (select .cse130 .cse6) v_prenex_10)))))))) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_prenex_10 Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse132 (select (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (forall ((v_prenex_11 Int)) (let ((.cse131 (+ v_prenex_11 4))) (or (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse131) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< 0 (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse132 .cse5 v_prenex_9)) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6)) (+ v_prenex_10 4)) 5)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse131))))) (< (select .cse132 .cse6) v_prenex_10)))) (< v_prenex_10 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0))))) .cse125) (or .cse133 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2151 Int) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_prenex_10 Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse138 (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (let ((.cse134 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse138 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5 v_prenex_9))) (.cse136 (+ v_prenex_11 4)) (.cse135 (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse137 (+ v_prenex_10 4))) (or (< 0 (+ (select (select .cse134 (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse135 .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse136)) .cse137) 5)) (not (= (select v_arrayElimArr_12 .cse136) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< (select (select .cse134 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse136) v_prenex_10) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse136)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_prenex_10 0) (< 0 (+ 5 (select (select .cse138 (select .cse135 .cse6)) .cse137)))))))) (or (forall ((v_ArrVal_2151 Int) (v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2154 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_2152 (Array Int Int)) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse139 (select (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse140 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) (.cse141 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse139 .cse5 v_ArrVal_2166)))) (or (< (select .cse139 .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse140)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_ArrVal_2154 12) (not (= (select v_arrayElimArr_14 .cse140) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< (select (select .cse141 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse140) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (let ((.cse144 (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse142 (select .cse144 .cse6)) (.cse143 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select .cse141 .cse142) .cse143)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse144 .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) .cse142) .cse143))))))))) .cse125) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2151 Int) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_prenex_10 Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse145 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5 v_prenex_9))) (.cse146 (+ v_prenex_11 4))) (or (< 0 (+ (select (select .cse145 (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse146)) (+ v_prenex_10 4)) 5)) (not (= (select v_arrayElimArr_12 .cse146) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< (select (select .cse145 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse146) v_prenex_10) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse146)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_prenex_10 0)))) .cse133) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2151 Int) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_prenex_10 Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse149 (select (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse147 (+ v_prenex_11 4)) (.cse148 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse149 .cse5 v_prenex_9)))) (or (not (= (select v_arrayElimArr_12 .cse147) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< (select (select .cse148 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse147) v_prenex_10) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse147)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_prenex_10 0) (< (select .cse149 .cse6) v_prenex_10) (< 0 (+ (select (select .cse148 (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6)) (+ v_prenex_10 4)) 5)))))) .cse125) (or (and (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int)) (let ((.cse150 (select (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (< (select .cse150 .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse151 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse151)) (forall ((v_arrayElimArr_14 (Array Int Int))) (let ((.cse158 (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse152 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse150 .cse5 v_ArrVal_2166))) (.cse155 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse156 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse158 .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (.cse154 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (or (not (= (select v_arrayElimArr_14 .cse151) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (let ((.cse153 (select (select .cse156 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse151))) (< (+ 7 (select (select .cse152 .cse153) .cse154)) (select .cse155 (select (select .cse156 .cse153) .cse154)))) (let ((.cse157 (select .cse158 .cse6))) (< (+ 7 (select (select .cse152 .cse157) .cse154)) (select .cse155 (select (select .cse156 .cse157) .cse154)))))))))))))))) (< v_ArrVal_2154 12))))) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int)) (let ((.cse159 (select (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (< (select .cse159 .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse160 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse160)) (forall ((v_arrayElimArr_14 (Array Int Int))) (or (not (= (select v_arrayElimArr_14 .cse160) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (let ((.cse163 (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse161 (select .cse163 .cse6)) (.cse162 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse159 .cse5 v_ArrVal_2166)) .cse161) .cse162)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse163 .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) .cse161) .cse162))))))))))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0))))) .cse125) (or (and (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse167 (+ v_prenex_11 4))) (let ((.cse168 (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse166 (select v_arrayElimArr_12 .cse167))) (let ((.cse164 (store .cse168 .cse166 (store (select .cse168 .cse166) .cse5 v_prenex_9)))) (or (< 0 (+ (select (select .cse164 (select (select (let ((.cse165 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse165 .cse166 (store (select .cse165 .cse166) .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6)) (+ v_prenex_10 4)) 5)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse167)) (< (select (select .cse164 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse167) v_prenex_10) (< v_prenex_10 0) (< (select (select .cse168 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6) v_prenex_10)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse169 (+ v_prenex_11 4))) (let ((.cse171 (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse174 (select v_arrayElimArr_12 .cse169))) (let ((.cse170 (store .cse171 .cse174 (store (select .cse171 .cse174) .cse5 v_prenex_9))) (.cse172 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12)) (.cse173 (+ v_prenex_10 4))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse169)) (< (select (select .cse170 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse169) v_prenex_10) (< v_prenex_10 0) (< 0 (+ 5 (select (select .cse171 (select (select .cse172 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6)) .cse173))) (< (select (select .cse171 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6) v_prenex_10) (< 0 (+ (select (select .cse170 (select (select (store .cse172 .cse174 (store (select .cse172 .cse174) .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse169)) .cse173) 5))))))))) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse175 (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse176 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< (select (select .cse175 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse176)) (let ((.cse177 (select v_arrayElimArr_14 .cse176))) (let ((.cse180 (let ((.cse181 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse181 .cse177 (store (select .cse181 .cse177) .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (let ((.cse178 (select (select .cse180 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6)) (.cse179 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select (store .cse175 .cse177 (store (select .cse175 .cse177) .cse5 v_ArrVal_2166)) .cse178) .cse179)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select .cse180 .cse178) .cse179))))))))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse183 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse182 (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse191 (select v_arrayElimArr_14 .cse183))) (let ((.cse184 (store .cse182 .cse191 (store (select .cse182 .cse191) .cse5 v_ArrVal_2166))) (.cse187 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse186 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse188 (let ((.cse190 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse190 .cse191 (store (select .cse190 .cse191) .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (or (< (select (select .cse182 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse183)) (let ((.cse185 (select (select .cse188 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6))) (< (+ 7 (select (select .cse184 .cse185) .cse186)) (select .cse187 (select (select .cse188 .cse185) .cse186)))) (< (select (select .cse184 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse183) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (let ((.cse189 (select (select .cse188 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse183))) (< (+ 7 (select (select .cse184 .cse189) .cse186)) (select .cse187 (select (select .cse188 .cse189) .cse186))))))))) (< v_ArrVal_2154 12))))) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_ArrVal_2154 Int)) (or (< v_ArrVal_2154 12) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse193 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse192 (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse201 (select v_arrayElimArr_14 .cse193))) (let ((.cse194 (store .cse192 .cse201 (store (select .cse192 .cse201) .cse5 v_ArrVal_2166))) (.cse197 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse196 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4)) (.cse198 (let ((.cse200 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse200 .cse201 (store (select .cse200 .cse201) .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (or (< (select (select .cse192 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse193)) (let ((.cse195 (select (select .cse198 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6))) (< (+ 7 (select (select .cse194 .cse195) .cse196)) (select .cse197 (select (select .cse198 .cse195) .cse196)))) (let ((.cse199 (select (select .cse198 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse193))) (< (+ 7 (select (select .cse194 .cse199) .cse196)) (select .cse197 (select (select .cse198 .cse199) .cse196))))))))))))) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse205 (+ v_prenex_11 4)) (.cse202 (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (or (< 0 (+ (select (let ((.cse203 (select v_arrayElimArr_12 .cse205))) (select (store .cse202 .cse203 (store (select .cse202 .cse203) .cse5 v_prenex_9)) (select (select (let ((.cse204 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse204 .cse203 (store (select .cse204 .cse203) .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6))) (+ v_prenex_10 4)) 5)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse205)) (< v_prenex_10 0) (< (select (select .cse202 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6) v_prenex_10)))))) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_ArrVal_2154 Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse207 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse206 (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13)) (.cse213 (select v_arrayElimArr_14 .cse207))) (let ((.cse208 (store .cse206 .cse213 (store (select .cse206 .cse213) .cse5 v_ArrVal_2166)))) (or (< (select (select .cse206 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse207)) (let ((.cse211 (let ((.cse212 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14))) (store .cse212 .cse213 (store (select .cse212 .cse213) .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))))) (let ((.cse209 (select (select .cse211 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6)) (.cse210 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select .cse208 .cse209) .cse210)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select .cse211 .cse209) .cse210))))) (< (select (select .cse208 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse207) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))) (< v_ArrVal_2154 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)))) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse217 (+ v_prenex_11 4))) (let ((.cse218 (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11)) (.cse220 (select v_arrayElimArr_12 .cse217))) (let ((.cse214 (store .cse218 .cse220 (store (select .cse218 .cse220) .cse5 v_prenex_9))) (.cse215 (let ((.cse219 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12))) (store .cse219 .cse220 (store (select .cse219 .cse220) .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))) (.cse216 (+ v_prenex_10 4))) (or (< 0 (+ (select (select .cse214 (select (select .cse215 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6)) .cse216) 5)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse217)) (< v_prenex_10 0) (< (select (select .cse218 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6) v_prenex_10) (< 0 (+ (select (select .cse214 (select (select .cse215 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse217)) .cse216) 5)))))))))) .cse125) (or .cse133 (forall ((v_ArrVal_2151 Int) (v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2154 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_2152 (Array Int Int)) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse228 (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse221 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) (.cse222 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5 v_ArrVal_2166))) (.cse225 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse226 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse228 .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (.cse224 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse221)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_ArrVal_2154 12) (not (= (select v_arrayElimArr_14 .cse221) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (let ((.cse223 (select (select .cse226 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse221))) (< (+ 7 (select (select .cse222 .cse223) .cse224)) (select .cse225 (select (select .cse226 .cse223) .cse224)))) (< (select (select .cse222 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse221) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (let ((.cse227 (select .cse228 .cse6))) (< (+ 7 (select (select .cse222 .cse227) .cse224)) (select .cse225 (select (select .cse226 .cse227) .cse224))))))))) (or .cse133 (forall ((v_ArrVal_2151 Int) (v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2154 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_2152 (Array Int Int)) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse237 (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse229 (select (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse230 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) (.cse231 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse229 .cse5 v_ArrVal_2166))) (.cse234 (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154)) (.cse235 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse237 .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|))) (.cse233 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (or (< (select .cse229 .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse230)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_ArrVal_2154 12) (not (= (select v_arrayElimArr_14 .cse230) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (let ((.cse232 (select (select .cse235 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse230))) (< (+ 7 (select (select .cse231 .cse232) .cse233)) (select .cse234 (select (select .cse235 .cse232) .cse233)))) (< (select (select .cse231 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse230) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|) (let ((.cse236 (select .cse237 .cse6))) (< (+ 7 (select (select .cse231 .cse236) .cse233)) (select .cse234 (select (select .cse235 .cse236) .cse233))))))))) (or .cse133 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2151 Int) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_11 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_prenex_10 Int) (v_ArrVal_2153 (Array Int Int)) (v_ArrVal_2152 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse242 (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11))) (let ((.cse243 (select .cse242 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse238 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse243 .cse5 v_prenex_9))) (.cse240 (+ v_prenex_11 4)) (.cse239 (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse241 (+ v_prenex_10 4))) (or (< 0 (+ (select (select .cse238 (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_12) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse239 .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)) |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse240)) .cse241) 5)) (not (= (select v_arrayElimArr_12 .cse240) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< (select (select .cse238 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse240) v_prenex_10) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_11 .cse240)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_prenex_10 0) (< 0 (+ 5 (select (select .cse242 (select .cse239 .cse6)) .cse241))) (< (select .cse243 .cse6) v_prenex_10))))))) (or .cse133 (forall ((v_ArrVal_2151 Int) (v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2154 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_33| Int) (v_ArrVal_2153 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_2152 (Array Int Int)) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse245 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select (store (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2153) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_13) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5 v_ArrVal_2166))) (.cse244 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 0) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 .cse244)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) 0)) (< v_ArrVal_2154 12) (not (= (select v_arrayElimArr_14 .cse244) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (let ((.cse248 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 .cse5 v_ArrVal_2151)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2152) |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_arrayElimArr_14) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|)))) (let ((.cse246 (select (select .cse248 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse244)) (.cse247 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_28| 4))) (< (+ 7 (select (select .cse245 .cse246) .cse247)) (select (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_33| v_ArrVal_2154) (select (select .cse248 .cse246) .cse247))))) (< (select (select .cse245 |v_ULTIMATE.start_node_create_~temp~0#1.base_33|) .cse244) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))))) is different from true [2024-11-27 19:59:18,588 INFO L349 Elim1Store]: treesize reduction 358, result has 19.2 percent of original size [2024-11-27 19:59:18,589 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 3 case distinctions, treesize of input 6855 treesize of output 6488 [2024-11-27 19:59:18,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 19:59:19,052 INFO L349 Elim1Store]: treesize reduction 52, result has 47.5 percent of original size [2024-11-27 19:59:19,053 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 30496 treesize of output 19642 [2024-11-27 19:59:19,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:59:19,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 13044 treesize of output 12896 [2024-11-27 19:59:19,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:59:19,684 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 6205 treesize of output 5933 [2024-11-27 19:59:20,097 INFO L349 Elim1Store]: treesize reduction 34, result has 67.0 percent of original size [2024-11-27 19:59:20,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32026 treesize of output 31437 [2024-11-27 19:59:20,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:59:20,957 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 6707 treesize of output 6615 [2024-11-27 19:59:21,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:59:21,205 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 8930 treesize of output 7922 [2024-11-27 19:59:21,673 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 735 treesize of output 719 [2024-11-27 19:59:22,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:59:22,733 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 59 treesize of output 59 [2024-11-27 19:59:22,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:59:22,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 60 [2024-11-27 19:59:23,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:59:23,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 305 treesize of output 280 [2024-11-27 19:59:23,636 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:59:23,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:59:23,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 47915 treesize of output 46521 [2024-11-27 19:59:23,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:59:23,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 9014 treesize of output 5374 [2024-11-27 19:59:24,088 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 19:59:24,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:59:24,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 3288582 treesize of output 3012992 [2024-11-27 19:59:29,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:59:29,311 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 45248 treesize of output 41204 [2024-11-27 19:59:29,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:59:29,977 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 43547 treesize of output 42375 [2024-11-27 19:59:31,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:59:31,428 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 45248 treesize of output 37460 [2024-11-27 19:59:32,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:59:32,415 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 42813 treesize of output 40241 [2024-11-27 19:59:35,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-27 20:00:08,444 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 5662 treesize of output 5598 [2024-11-27 20:01:03,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:01:03,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1129 treesize of output 1123 [2024-11-27 20:01:15,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:01:15,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18800 treesize of output 18426 [2024-11-27 20:08:45,167 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-27 20:08:45,167 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-27 20:08:45,168 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-27 20:08:45,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-27 20:08:45,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-27 20:08:45,369 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:590) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 95 more [2024-11-27 20:08:45,384 INFO L158 Benchmark]: Toolchain (without parser) took 754377.43ms. Allocated memory was 117.4MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 91.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-27 20:08:45,385 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 117.4MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:08:45,385 INFO L158 Benchmark]: CACSL2BoogieTranslator took 622.75ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 73.4MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 20:08:45,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.64ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 71.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:08:45,385 INFO L158 Benchmark]: Boogie Preprocessor took 70.07ms. Allocated memory is still 117.4MB. Free memory was 71.5MB in the beginning and 68.9MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:08:45,385 INFO L158 Benchmark]: RCFGBuilder took 723.93ms. Allocated memory is still 117.4MB. Free memory was 68.9MB in the beginning and 46.2MB in the end (delta: 22.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:08:45,386 INFO L158 Benchmark]: TraceAbstraction took 752900.19ms. Allocated memory was 117.4MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 45.7MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-27 20:08:45,391 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 117.4MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 622.75ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 73.4MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.64ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 71.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 70.07ms. Allocated memory is still 117.4MB. Free memory was 71.5MB in the beginning and 68.9MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 723.93ms. Allocated memory is still 117.4MB. Free memory was 68.9MB in the beginning and 46.2MB in the end (delta: 22.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 752900.19ms. Allocated memory was 117.4MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 45.7MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB --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 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:08:48,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:08:48,678 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-27 20:08:48,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:08:48,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:08:48,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:08:48,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:08:48,765 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:08:48,765 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:08:48,765 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:08:48,766 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:08:48,766 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:08:48,766 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:08:48,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:08:48,767 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:08:48,767 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:08:48,767 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:08:48,767 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:08:48,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:08:48,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:08:48,768 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 20:08:48,768 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 20:08:48,768 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 20:08:48,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:08:48,769 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:08:48,769 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 20:08:48,769 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 20:08:48,769 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 20:08:48,769 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:08:48,769 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:08:48,770 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:08:48,770 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:08:48,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:08:48,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:08:48,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:08:48,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:08:48,771 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:08:48,771 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:08:48,771 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:08:48,771 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:08:48,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:08:48,771 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:08:48,771 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:08:48,771 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 20:08:48,772 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 20:08:48,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:08:48,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:08:48,772 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:08:48,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:08:48,773 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_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 [2024-11-27 20:08:49,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:08:49,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:08:49,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:08:49,201 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:08:49,202 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:08:49,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2024-11-27 20:08:53,016 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/data/862f25570/9d726c88901e4a07a45b797589771e21/FLAG25b64c816 [2024-11-27 20:08:53,368 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:08:53,369 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2024-11-27 20:08:53,384 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/data/862f25570/9d726c88901e4a07a45b797589771e21/FLAG25b64c816 [2024-11-27 20:08:53,408 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/data/862f25570/9d726c88901e4a07a45b797589771e21 [2024-11-27 20:08:53,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:08:53,414 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:08:53,416 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:08:53,416 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:08:53,423 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:08:53,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:08:53" (1/1) ... [2024-11-27 20:08:53,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6730f19a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:53, skipping insertion in model container [2024-11-27 20:08:53,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:08:53" (1/1) ... [2024-11-27 20:08:53,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:08:54,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:08:54,060 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:08:54,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:08:54,187 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:08:54,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:54 WrapperNode [2024-11-27 20:08:54,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:08:54,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:08:54,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:08:54,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:08:54,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:54" (1/1) ... [2024-11-27 20:08:54,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:54" (1/1) ... [2024-11-27 20:08:54,258 INFO L138 Inliner]: procedures = 130, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 119 [2024-11-27 20:08:54,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:08:54,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:08:54,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:08:54,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:08:54,271 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:54" (1/1) ... [2024-11-27 20:08:54,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:54" (1/1) ... [2024-11-27 20:08:54,281 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:54" (1/1) ... [2024-11-27 20:08:54,330 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 7, 12]. 57 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 10 writes are split as follows [0, 1, 9]. [2024-11-27 20:08:54,331 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:54" (1/1) ... [2024-11-27 20:08:54,331 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:54" (1/1) ... [2024-11-27 20:08:54,359 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:54" (1/1) ... [2024-11-27 20:08:54,363 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:54" (1/1) ... [2024-11-27 20:08:54,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:54" (1/1) ... [2024-11-27 20:08:54,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:54" (1/1) ... [2024-11-27 20:08:54,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:54" (1/1) ... [2024-11-27 20:08:54,391 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:08:54,392 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:08:54,392 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:08:54,392 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:08:54,394 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:54" (1/1) ... [2024-11-27 20:08:54,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:08:54,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:54,443 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:08:54,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:08:54,493 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-27 20:08:54,493 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-27 20:08:54,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-27 20:08:54,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-27 20:08:54,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-27 20:08:54,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 20:08:54,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:08:54,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 20:08:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-27 20:08:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-27 20:08:54,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-27 20:08:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-27 20:08:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-27 20:08:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-27 20:08:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 20:08:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-27 20:08:54,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-27 20:08:54,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-27 20:08:54,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-27 20:08:54,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-27 20:08:54,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-27 20:08:54,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 20:08:54,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-27 20:08:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-27 20:08:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:08:54,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:08:54,757 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:08:54,760 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:08:54,798 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-27 20:08:55,662 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-27 20:08:55,662 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:08:55,687 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:08:55,687 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-27 20:08:55,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:08:55 BoogieIcfgContainer [2024-11-27 20:08:55,688 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:08:55,693 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:08:55,693 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:08:55,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:08:55,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:08:53" (1/3) ... [2024-11-27 20:08:55,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e0a2cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:08:55, skipping insertion in model container [2024-11-27 20:08:55,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:54" (2/3) ... [2024-11-27 20:08:55,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e0a2cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:08:55, skipping insertion in model container [2024-11-27 20:08:55,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:08:55" (3/3) ... [2024-11-27 20:08:55,707 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal.i [2024-11-27 20:08:55,727 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:08:55,729 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_prepend_equal.i that has 2 procedures, 99 locations, 1 initial locations, 3 loop locations, and 41 error locations. [2024-11-27 20:08:55,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:08:55,815 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;@60236d37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:08:55,815 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-11-27 20:08:55,823 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 54 states have (on average 2.0) internal successors, (108), 96 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:08:55,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-27 20:08:55,831 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:55,831 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-27 20:08:55,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 20:08:55,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:55,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1037518442, now seen corresponding path program 1 times [2024-11-27 20:08:55,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:08:55,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1018718925] [2024-11-27 20:08:55,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:55,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:55,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:55,866 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:08:55,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:08:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:56,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:08:56,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:08:56,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:08:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:08:56,136 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:08:56,136 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:08:56,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018718925] [2024-11-27 20:08:56,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018718925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:08:56,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:08:56,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:08:56,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505175810] [2024-11-27 20:08:56,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:08:56,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:08:56,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:08:56,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:08:56,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:08:56,183 INFO L87 Difference]: Start difference. First operand has 98 states, 54 states have (on average 2.0) internal successors, (108), 96 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:08:56,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:56,531 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2024-11-27 20:08:56,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:08:56,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-27 20:08:56,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:56,545 INFO L225 Difference]: With dead ends: 94 [2024-11-27 20:08:56,546 INFO L226 Difference]: Without dead ends: 88 [2024-11-27 20:08:56,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:08:56,555 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 9 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:56,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 139 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:08:56,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-27 20:08:56,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-27 20:08:56,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 50 states have (on average 1.86) internal successors, (93), 87 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:08:56,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2024-11-27 20:08:56,618 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 6 [2024-11-27 20:08:56,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:56,618 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2024-11-27 20:08:56,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:08:56,619 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2024-11-27 20:08:56,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-27 20:08:56,619 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:56,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-27 20:08:56,632 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 20:08:56,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:56,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 20:08:56,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:56,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1037518443, now seen corresponding path program 1 times [2024-11-27 20:08:56,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:08:56,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [584004444] [2024-11-27 20:08:56,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:56,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:56,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:56,826 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:08:56,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:08:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:56,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 20:08:56,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:08:56,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:08:56,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:08:56,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:08:56,985 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:08:56,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584004444] [2024-11-27 20:08:56,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584004444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:08:56,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:08:56,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:08:56,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89692024] [2024-11-27 20:08:56,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:08:56,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:08:56,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:08:56,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:08:56,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:08:56,988 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:08:57,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:57,281 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2024-11-27 20:08:57,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:08:57,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-27 20:08:57,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:57,283 INFO L225 Difference]: With dead ends: 85 [2024-11-27 20:08:57,283 INFO L226 Difference]: Without dead ends: 85 [2024-11-27 20:08:57,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:08:57,284 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 8 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:57,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 131 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:08:57,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-27 20:08:57,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-27 20:08:57,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.8) internal successors, (90), 84 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:08:57,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-11-27 20:08:57,293 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 6 [2024-11-27 20:08:57,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:57,294 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-11-27 20:08:57,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:08:57,294 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-11-27 20:08:57,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-27 20:08:57,295 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:57,295 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:08:57,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-27 20:08:57,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:57,499 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 20:08:57,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:57,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2101067345, now seen corresponding path program 1 times [2024-11-27 20:08:57,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:08:57,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [841347358] [2024-11-27 20:08:57,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:57,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:57,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:57,502 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:08:57,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 20:08:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:57,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:08:57,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:08:57,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:08:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:08:57,641 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:08:57,641 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:08:57,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841347358] [2024-11-27 20:08:57,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841347358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:08:57,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:08:57,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:08:57,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072770350] [2024-11-27 20:08:57,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:08:57,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:08:57,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:08:57,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:08:57,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:08:57,643 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:08:57,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:57,880 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2024-11-27 20:08:57,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:08:57,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2024-11-27 20:08:57,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:57,882 INFO L225 Difference]: With dead ends: 82 [2024-11-27 20:08:57,882 INFO L226 Difference]: Without dead ends: 82 [2024-11-27 20:08:57,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:08:57,883 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 3 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:57,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 122 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:08:57,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-27 20:08:57,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-27 20:08:57,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.74) internal successors, (87), 81 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:08:57,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2024-11-27 20:08:57,890 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 7 [2024-11-27 20:08:57,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:57,891 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2024-11-27 20:08:57,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:08:57,891 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2024-11-27 20:08:57,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-27 20:08:57,892 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:57,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:08:57,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-27 20:08:58,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:58,097 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 20:08:58,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:58,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2101067346, now seen corresponding path program 1 times [2024-11-27 20:08:58,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:08:58,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1077895563] [2024-11-27 20:08:58,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:58,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:58,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:58,102 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:08:58,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 20:08:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:58,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 20:08:58,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:08:58,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:08:58,261 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:08:58,261 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:08:58,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077895563] [2024-11-27 20:08:58,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077895563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:08:58,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:08:58,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:08:58,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578656935] [2024-11-27 20:08:58,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:08:58,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:08:58,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:08:58,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:08:58,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:08:58,266 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:08:58,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:58,296 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2024-11-27 20:08:58,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:08:58,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2024-11-27 20:08:58,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:58,299 INFO L225 Difference]: With dead ends: 93 [2024-11-27 20:08:58,302 INFO L226 Difference]: Without dead ends: 93 [2024-11-27 20:08:58,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:08:58,303 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:58,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 167 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:08:58,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-27 20:08:58,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2024-11-27 20:08:58,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.7254901960784315) internal successors, (88), 82 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:08:58,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2024-11-27 20:08:58,315 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 7 [2024-11-27 20:08:58,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:58,319 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2024-11-27 20:08:58,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:08:58,320 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2024-11-27 20:08:58,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-27 20:08:58,320 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:58,320 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:08:58,333 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-27 20:08:58,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:58,525 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 20:08:58,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:58,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1519983918, now seen corresponding path program 1 times [2024-11-27 20:08:58,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:08:58,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [948944648] [2024-11-27 20:08:58,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:58,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:58,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:58,532 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:08:58,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 20:08:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:58,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:08:58,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:08:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:08:58,760 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:08:58,760 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:08:58,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948944648] [2024-11-27 20:08:58,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948944648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:08:58,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:08:58,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:08:58,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977725104] [2024-11-27 20:08:58,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:08:58,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:08:58,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:08:58,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:08:58,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:08:58,766 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:08:58,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:58,835 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2024-11-27 20:08:58,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:08:58,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-11-27 20:08:58,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:58,838 INFO L225 Difference]: With dead ends: 89 [2024-11-27 20:08:58,841 INFO L226 Difference]: Without dead ends: 89 [2024-11-27 20:08:58,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:08:58,842 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:58,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:08:58,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-27 20:08:58,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-27 20:08:58,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 88 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:08:58,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2024-11-27 20:08:58,857 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 10 [2024-11-27 20:08:58,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:58,857 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2024-11-27 20:08:58,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:08:58,858 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2024-11-27 20:08:58,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-27 20:08:58,858 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:58,858 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:08:58,872 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-27 20:08:59,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:59,059 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 20:08:59,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:59,060 INFO L85 PathProgramCache]: Analyzing trace with hash 973131719, now seen corresponding path program 1 times [2024-11-27 20:08:59,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:08:59,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [587323930] [2024-11-27 20:08:59,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:59,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:59,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:59,065 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:08:59,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 20:08:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:59,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-27 20:08:59,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:08:59,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:08:59,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:08:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:08:59,365 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:08:59,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587323930] [2024-11-27 20:08:59,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587323930] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:08:59,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:08:59,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2024-11-27 20:08:59,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574146650] [2024-11-27 20:08:59,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:08:59,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:08:59,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:08:59,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:08:59,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:08:59,368 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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-11-27 20:08:59,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:59,442 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2024-11-27 20:08:59,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:08:59,443 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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 15 [2024-11-27 20:08:59,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:59,444 INFO L225 Difference]: With dead ends: 113 [2024-11-27 20:08:59,444 INFO L226 Difference]: Without dead ends: 113 [2024-11-27 20:08:59,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:08:59,447 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 40 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:59,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 340 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:08:59,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-27 20:08:59,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2024-11-27 20:08:59,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 77 states have (on average 1.5714285714285714) internal successors, (121), 108 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:08:59,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2024-11-27 20:08:59,467 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 15 [2024-11-27 20:08:59,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:59,467 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2024-11-27 20:08:59,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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-11-27 20:08:59,468 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2024-11-27 20:08:59,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-27 20:08:59,468 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:59,468 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-27 20:08:59,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-27 20:08:59,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:59,670 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 20:08:59,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:59,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1281123431, now seen corresponding path program 1 times [2024-11-27 20:08:59,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:08:59,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1575270640] [2024-11-27 20:08:59,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:59,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:59,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:59,674 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:08:59,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 20:08:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:59,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-27 20:08:59,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:08:59,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:08:59,944 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-27 20:08:59,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-27 20:08:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:08:59,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:09:00,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:09:00,079 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:09:00,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575270640] [2024-11-27 20:09:00,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575270640] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:09:00,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:09:00,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2024-11-27 20:09:00,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979071535] [2024-11-27 20:09:00,080 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:09:00,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:09:00,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:09:00,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:09:00,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:09:00,082 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:00,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:00,488 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2024-11-27 20:09:00,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:09:00,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-11-27 20:09:00,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:00,494 INFO L225 Difference]: With dead ends: 108 [2024-11-27 20:09:00,494 INFO L226 Difference]: Without dead ends: 108 [2024-11-27 20:09:00,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:09:00,495 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 4 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:00,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 164 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 20:09:00,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-27 20:09:00,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-27 20:09:00,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.5324675324675325) internal successors, (118), 107 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-11-27 20:09:00,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2024-11-27 20:09:00,510 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 18 [2024-11-27 20:09:00,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:00,510 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2024-11-27 20:09:00,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:00,511 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2024-11-27 20:09:00,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-27 20:09:00,515 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:00,515 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:00,527 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-27 20:09:00,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:00,716 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 20:09:00,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:00,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1281123430, now seen corresponding path program 1 times [2024-11-27 20:09:00,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:09:00,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1187576412] [2024-11-27 20:09:00,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:00,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:00,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:00,720 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:00,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-27 20:09:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:00,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-27 20:09:00,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:00,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:09:00,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:09:01,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:09:01,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-27 20:09:01,129 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:09:01,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:09:01,198 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:09:01,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:09:05,862 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:09:05,862 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:09:05,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187576412] [2024-11-27 20:09:05,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187576412] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:09:05,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:09:05,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-27 20:09:05,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172813770] [2024-11-27 20:09:05,862 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:09:05,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:09:05,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:09:05,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:09:05,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2024-11-27 20:09:05,864 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:07,253 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2024-11-27 20:09:07,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:09:07,255 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 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 18 [2024-11-27 20:09:07,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:07,256 INFO L225 Difference]: With dead ends: 107 [2024-11-27 20:09:07,256 INFO L226 Difference]: Without dead ends: 107 [2024-11-27 20:09:07,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=26, Invalid=45, Unknown=1, NotChecked=0, Total=72 [2024-11-27 20:09:07,257 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 14 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:07,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 252 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-27 20:09:07,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-27 20:09:07,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-27 20:09:07,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 77 states have (on average 1.4935064935064934) internal successors, (115), 106 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:07,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2024-11-27 20:09:07,267 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 18 [2024-11-27 20:09:07,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:07,267 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2024-11-27 20:09:07,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:07,268 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2024-11-27 20:09:07,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-27 20:09:07,269 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:07,269 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:07,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-27 20:09:07,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:07,470 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 20:09:07,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:07,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1335124932, now seen corresponding path program 2 times [2024-11-27 20:09:07,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:09:07,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [988664175] [2024-11-27 20:09:07,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:09:07,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:07,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:07,473 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:07,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-27 20:09:07,607 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 20:09:07,607 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:09:07,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 20:09:07,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:07,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:09:07,651 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-27 20:09:07,652 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:09:07,652 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:09:07,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988664175] [2024-11-27 20:09:07,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988664175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:07,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:07,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:09:07,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460063915] [2024-11-27 20:09:07,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:07,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:09:07,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:09:07,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:09:07,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:09:07,654 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:07,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:07,894 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2024-11-27 20:09:07,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:09:07,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-27 20:09:07,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:07,896 INFO L225 Difference]: With dead ends: 104 [2024-11-27 20:09:07,896 INFO L226 Difference]: Without dead ends: 104 [2024-11-27 20:09:07,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:09:07,897 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 3 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:07,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 123 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:09:07,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-27 20:09:07,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-27 20:09:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 103 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-11-27 20:09:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2024-11-27 20:09:07,904 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 23 [2024-11-27 20:09:07,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:07,904 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2024-11-27 20:09:07,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2024-11-27 20:09:07,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-27 20:09:07,905 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:07,905 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:07,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-27 20:09:08,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:08,110 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 20:09:08,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:08,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1960451559, now seen corresponding path program 1 times [2024-11-27 20:09:08,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:09:08,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1622882555] [2024-11-27 20:09:08,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:08,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:08,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:08,113 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:08,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-27 20:09:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:08,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:09:08,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:08,351 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:09:08,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:09:08,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:09:08,398 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:09:08,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622882555] [2024-11-27 20:09:08,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622882555] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:09:08,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:09:08,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2024-11-27 20:09:08,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238705283] [2024-11-27 20:09:08,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:09:08,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:09:08,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:09:08,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:09:08,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:09:08,400 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 4 states, 4 states have (on average 7.0) 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-11-27 20:09:08,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:08,551 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2024-11-27 20:09:08,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:09:08,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) 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-11-27 20:09:08,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:08,553 INFO L225 Difference]: With dead ends: 104 [2024-11-27 20:09:08,553 INFO L226 Difference]: Without dead ends: 104 [2024-11-27 20:09:08,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:09:08,554 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:08,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 217 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:09:08,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-27 20:09:08,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-27 20:09:08,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 103 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-11-27 20:09:08,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2024-11-27 20:09:08,567 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 28 [2024-11-27 20:09:08,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:08,568 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2024-11-27 20:09:08,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) 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-11-27 20:09:08,568 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2024-11-27 20:09:08,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-27 20:09:08,572 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:08,572 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:08,586 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-27 20:09:08,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:08,773 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 20:09:08,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:08,774 INFO L85 PathProgramCache]: Analyzing trace with hash 144666817, now seen corresponding path program 1 times [2024-11-27 20:09:08,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:09:08,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1800985628] [2024-11-27 20:09:08,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:08,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:08,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:08,778 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:08,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-27 20:09:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:08,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-27 20:09:08,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:09,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:09:09,060 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-27 20:09:09,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-27 20:09:09,142 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-27 20:09:09,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-27 20:09:09,228 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-27 20:09:09,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-27 20:09:09,265 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-27 20:09:09,265 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:09:09,266 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:09:09,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800985628] [2024-11-27 20:09:09,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800985628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:09,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:09,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:09:09,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197131390] [2024-11-27 20:09:09,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:09,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:09:09,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:09:09,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:09:09,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:09:09,267 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:09,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:09,636 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2024-11-27 20:09:09,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:09:09,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-27 20:09:09,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:09,640 INFO L225 Difference]: With dead ends: 110 [2024-11-27 20:09:09,640 INFO L226 Difference]: Without dead ends: 110 [2024-11-27 20:09:09,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:09:09,642 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 69 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:09,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 79 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:09:09,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-27 20:09:09,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 98. [2024-11-27 20:09:09,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 97 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-11-27 20:09:09,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2024-11-27 20:09:09,650 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 29 [2024-11-27 20:09:09,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:09,650 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2024-11-27 20:09:09,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:09,650 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2024-11-27 20:09:09,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-27 20:09:09,651 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:09,651 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:09,665 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-27 20:09:09,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:09,852 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 20:09:09,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:09,852 INFO L85 PathProgramCache]: Analyzing trace with hash 144666818, now seen corresponding path program 1 times [2024-11-27 20:09:09,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:09:09,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1413483088] [2024-11-27 20:09:09,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:09,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:09,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:09,858 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:09,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-27 20:09:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:10,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-27 20:09:10,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:10,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:09:10,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:09:10,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:09:10,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-27 20:09:10,208 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-27 20:09:10,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-27 20:09:10,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:09:10,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-27 20:09:10,389 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:09:10,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:09:10,528 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-27 20:09:10,529 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 12 treesize of output 18 [2024-11-27 20:09:10,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 20:09:10,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:09:24,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:09:24,065 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:09:24,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413483088] [2024-11-27 20:09:24,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413483088] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:09:24,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:09:24,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2024-11-27 20:09:24,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005572641] [2024-11-27 20:09:24,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:09:24,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:09:24,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:09:24,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:09:24,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=47, Unknown=3, NotChecked=0, Total=72 [2024-11-27 20:09:24,067 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:24,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:24,816 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2024-11-27 20:09:24,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:09:24,818 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-27 20:09:24,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:24,818 INFO L225 Difference]: With dead ends: 92 [2024-11-27 20:09:24,818 INFO L226 Difference]: Without dead ends: 92 [2024-11-27 20:09:24,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=31, Invalid=56, Unknown=3, NotChecked=0, Total=90 [2024-11-27 20:09:24,819 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 99 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:24,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 145 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-27 20:09:24,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-27 20:09:24,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-27 20:09:24,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 91 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:24,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2024-11-27 20:09:24,823 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 29 [2024-11-27 20:09:24,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:24,824 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2024-11-27 20:09:24,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:24,824 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2024-11-27 20:09:24,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-27 20:09:24,825 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:24,825 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:24,841 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-27 20:09:25,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:25,026 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 20:09:25,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:25,026 INFO L85 PathProgramCache]: Analyzing trace with hash 189704073, now seen corresponding path program 1 times [2024-11-27 20:09:25,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:09:25,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [55898712] [2024-11-27 20:09:25,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:25,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:25,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:25,029 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:25,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-27 20:09:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:25,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 20:09:25,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:25,286 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-27 20:09:25,287 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:09:25,287 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:09:25,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55898712] [2024-11-27 20:09:25,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55898712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:25,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:25,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:09:25,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734417698] [2024-11-27 20:09:25,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:25,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:09:25,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:09:25,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:09:25,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:09:25,289 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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-11-27 20:09:25,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:25,748 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2024-11-27 20:09:25,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:09:25,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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 30 [2024-11-27 20:09:25,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:25,749 INFO L225 Difference]: With dead ends: 91 [2024-11-27 20:09:25,750 INFO L226 Difference]: Without dead ends: 91 [2024-11-27 20:09:25,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:09:25,750 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:25,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 154 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 20:09:25,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-27 20:09:25,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-27 20:09:25,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 90 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2024-11-27 20:09:25,755 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 30 [2024-11-27 20:09:25,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:25,755 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2024-11-27 20:09:25,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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-11-27 20:09:25,756 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2024-11-27 20:09:25,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-27 20:09:25,757 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:25,760 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:25,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-27 20:09:25,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:25,965 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 20:09:25,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:25,965 INFO L85 PathProgramCache]: Analyzing trace with hash 189704074, now seen corresponding path program 1 times [2024-11-27 20:09:25,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:09:25,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [990269172] [2024-11-27 20:09:25,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:25,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:25,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:25,968 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:25,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-27 20:09:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:26,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-27 20:09:26,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:26,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:09:26,297 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-27 20:09:26,297 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:09:26,297 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:09:26,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990269172] [2024-11-27 20:09:26,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990269172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:26,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:26,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:09:26,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420432052] [2024-11-27 20:09:26,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:26,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:09:26,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:09:26,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:09:26,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:09:26,299 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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-11-27 20:09:26,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:26,682 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2024-11-27 20:09:26,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:09:26,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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 30 [2024-11-27 20:09:26,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:26,684 INFO L225 Difference]: With dead ends: 90 [2024-11-27 20:09:26,684 INFO L226 Difference]: Without dead ends: 90 [2024-11-27 20:09:26,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:09:26,685 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 10 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:26,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 166 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 20:09:26,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-27 20:09:26,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-27 20:09:26,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 89 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:26,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2024-11-27 20:09:26,689 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 30 [2024-11-27 20:09:26,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:26,689 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2024-11-27 20:09:26,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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-11-27 20:09:26,690 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2024-11-27 20:09:26,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-27 20:09:26,691 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:26,691 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-27 20:09:26,704 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-27 20:09:26,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:26,891 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 20:09:26,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:26,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1155959092, now seen corresponding path program 1 times [2024-11-27 20:09:26,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:09:26,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [817079714] [2024-11-27 20:09:26,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:26,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:26,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:26,894 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:26,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-27 20:09:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:27,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-27 20:09:27,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:27,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:09:27,253 INFO L349 Elim1Store]: treesize reduction 36, result has 35.7 percent of original size [2024-11-27 20:09:27,253 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 25 treesize of output 28 [2024-11-27 20:09:27,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-27 20:09:27,366 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 20:09:27,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:09:27,367 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:09:27,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817079714] [2024-11-27 20:09:27,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817079714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:27,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:27,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:09:27,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447085135] [2024-11-27 20:09:27,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:27,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:09:27,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:09:27,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:09:27,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:09:27,371 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 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-11-27 20:09:28,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:28,156 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2024-11-27 20:09:28,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:09:28,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 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 35 [2024-11-27 20:09:28,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:28,158 INFO L225 Difference]: With dead ends: 89 [2024-11-27 20:09:28,158 INFO L226 Difference]: Without dead ends: 89 [2024-11-27 20:09:28,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:09:28,160 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 12 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:28,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 205 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-27 20:09:28,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-27 20:09:28,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-27 20:09:28,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 88 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2024-11-27 20:09:28,165 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 35 [2024-11-27 20:09:28,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:28,165 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2024-11-27 20:09:28,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 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-11-27 20:09:28,165 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2024-11-27 20:09:28,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-27 20:09:28,166 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:28,166 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-27 20:09:28,178 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-27 20:09:28,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:28,367 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 20:09:28,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:28,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1155959091, now seen corresponding path program 1 times [2024-11-27 20:09:28,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:09:28,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2070290981] [2024-11-27 20:09:28,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:28,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:28,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:28,372 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:28,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-27 20:09:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:28,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-27 20:09:28,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:28,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:09:28,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:09:28,824 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-27 20:09:28,825 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 17 treesize of output 17 [2024-11-27 20:09:28,834 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-11-27 20:09:28,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-27 20:09:29,021 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 20:09:29,021 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:09:29,021 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:09:29,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070290981] [2024-11-27 20:09:29,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070290981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:29,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:29,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:09:29,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277845127] [2024-11-27 20:09:29,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:29,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:09:29,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:09:29,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:09:29,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:09:29,023 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 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-11-27 20:09:29,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:29,816 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2024-11-27 20:09:29,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:09:29,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 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 35 [2024-11-27 20:09:29,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:29,818 INFO L225 Difference]: With dead ends: 88 [2024-11-27 20:09:29,818 INFO L226 Difference]: Without dead ends: 88 [2024-11-27 20:09:29,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:09:29,819 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 11 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:29,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 204 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-27 20:09:29,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-27 20:09:29,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-27 20:09:29,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 87 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:29,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2024-11-27 20:09:29,823 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 35 [2024-11-27 20:09:29,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:29,823 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2024-11-27 20:09:29,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 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-11-27 20:09:29,824 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2024-11-27 20:09:29,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-27 20:09:29,824 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:29,825 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-11-27 20:09:29,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-27 20:09:30,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:30,025 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 20:09:30,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:30,026 INFO L85 PathProgramCache]: Analyzing trace with hash -24361986, now seen corresponding path program 1 times [2024-11-27 20:09:30,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:09:30,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [726662688] [2024-11-27 20:09:30,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:30,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:30,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:30,029 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:30,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-27 20:09:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:30,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-27 20:09:30,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:30,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-27 20:09:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 20:09:30,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:09:30,370 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:09:30,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726662688] [2024-11-27 20:09:30,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726662688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:30,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:30,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 20:09:30,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685471185] [2024-11-27 20:09:30,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:30,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:09:30,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:09:30,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:09:30,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:09:30,371 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 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-11-27 20:09:30,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:30,766 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2024-11-27 20:09:30,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:09:30,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 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 39 [2024-11-27 20:09:30,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:30,768 INFO L225 Difference]: With dead ends: 88 [2024-11-27 20:09:30,768 INFO L226 Difference]: Without dead ends: 88 [2024-11-27 20:09:30,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:09:30,768 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 13 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:30,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 294 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 20:09:30,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-27 20:09:30,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-27 20:09:30,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.1948051948051948) internal successors, (92), 87 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-11-27 20:09:30,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2024-11-27 20:09:30,773 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 39 [2024-11-27 20:09:30,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:30,773 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2024-11-27 20:09:30,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 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-11-27 20:09:30,773 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2024-11-27 20:09:30,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-27 20:09:30,774 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:30,774 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:30,788 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-27 20:09:30,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:30,976 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 20:09:30,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:30,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1117586266, now seen corresponding path program 1 times [2024-11-27 20:09:30,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:09:30,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [750098111] [2024-11-27 20:09:30,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:30,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:30,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:30,980 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:30,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-27 20:09:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:31,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-27 20:09:31,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:31,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:09:31,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 20:09:31,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 20:09:31,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-27 20:09:31,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-27 20:09:31,794 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:09:31,795 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:09:31,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750098111] [2024-11-27 20:09:31,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750098111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:31,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:31,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 20:09:31,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818754093] [2024-11-27 20:09:31,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:31,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:09:31,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:09:31,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:09:31,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:09:31,798 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:32,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:32,702 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2024-11-27 20:09:32,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:09:32,703 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 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 42 [2024-11-27 20:09:32,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:32,704 INFO L225 Difference]: With dead ends: 92 [2024-11-27 20:09:32,704 INFO L226 Difference]: Without dead ends: 92 [2024-11-27 20:09:32,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-27 20:09:32,704 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 27 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:32,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 214 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-27 20:09:32,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-27 20:09:32,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-27 20:09:32,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 91 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:32,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2024-11-27 20:09:32,709 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 42 [2024-11-27 20:09:32,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:32,709 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2024-11-27 20:09:32,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:32,709 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2024-11-27 20:09:32,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-27 20:09:32,710 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:32,710 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:32,723 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-27 20:09:32,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:32,915 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 20:09:32,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:32,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1117586265, now seen corresponding path program 1 times [2024-11-27 20:09:32,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:09:32,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [137125724] [2024-11-27 20:09:32,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:32,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:32,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:32,919 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:32,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-27 20:09:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:33,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-27 20:09:33,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:33,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 20:09:33,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-27 20:09:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-27 20:09:33,454 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:09:33,454 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:09:33,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137125724] [2024-11-27 20:09:33,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137125724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:33,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:33,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:09:33,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807829053] [2024-11-27 20:09:33,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:33,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:09:33,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:09:33,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:09:33,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:09:33,456 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:33,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:33,987 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2024-11-27 20:09:33,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:09:33,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 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 42 [2024-11-27 20:09:33,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:33,989 INFO L225 Difference]: With dead ends: 91 [2024-11-27 20:09:33,989 INFO L226 Difference]: Without dead ends: 91 [2024-11-27 20:09:33,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:09:33,990 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 22 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:33,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 171 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 20:09:33,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-27 20:09:33,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-27 20:09:33,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 90 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:33,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2024-11-27 20:09:33,994 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 42 [2024-11-27 20:09:33,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:33,994 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2024-11-27 20:09:33,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:33,995 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2024-11-27 20:09:33,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-27 20:09:33,995 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:33,995 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:34,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-27 20:09:34,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:34,201 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 20:09:34,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:34,202 INFO L85 PathProgramCache]: Analyzing trace with hash -571577224, now seen corresponding path program 1 times [2024-11-27 20:09:34,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:09:34,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1304752559] [2024-11-27 20:09:34,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:34,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:34,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:34,205 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:34,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-27 20:09:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-27 20:09:34,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:34,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 20:09:34,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-27 20:09:34,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-27 20:09:34,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:09:34,742 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:09:34,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304752559] [2024-11-27 20:09:34,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304752559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:34,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:34,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:09:34,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179730497] [2024-11-27 20:09:34,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:34,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:09:34,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:09:34,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:09:34,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:09:34,743 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 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-11-27 20:09:35,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:35,178 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2024-11-27 20:09:35,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:09:35,178 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 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 45 [2024-11-27 20:09:35,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:35,179 INFO L225 Difference]: With dead ends: 91 [2024-11-27 20:09:35,179 INFO L226 Difference]: Without dead ends: 91 [2024-11-27 20:09:35,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-27 20:09:35,180 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 24 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:35,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 284 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 20:09:35,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-27 20:09:35,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-27 20:09:35,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 81 states have (on average 1.1728395061728396) internal successors, (95), 90 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2024-11-27 20:09:35,184 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 45 [2024-11-27 20:09:35,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:35,185 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2024-11-27 20:09:35,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 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-11-27 20:09:35,185 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2024-11-27 20:09:35,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-27 20:09:35,186 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:35,186 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:35,197 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-27 20:09:35,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:35,387 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 20:09:35,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:35,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1834657434, now seen corresponding path program 1 times [2024-11-27 20:09:35,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:09:35,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2110923687] [2024-11-27 20:09:35,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:35,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:35,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:35,390 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:35,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-27 20:09:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:35,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-27 20:09:35,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:35,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:09:35,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:09:35,897 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-27 20:09:35,897 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 18 treesize of output 21 [2024-11-27 20:09:35,927 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-27 20:09:35,927 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 17 treesize of output 17 [2024-11-27 20:09:36,428 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-11-27 20:09:36,448 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-11-27 20:09:36,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:09:36,872 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 28 treesize of output 15 [2024-11-27 20:09:36,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:09:36,902 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 28 treesize of output 15 [2024-11-27 20:09:36,986 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 52 treesize of output 25 [2024-11-27 20:09:37,005 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-11-27 20:09:37,111 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 48 treesize of output 28 [2024-11-27 20:09:37,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-27 20:09:37,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-27 20:09:37,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 20:09:37,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:09:38,748 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (and (forall ((v_ArrVal_1134 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1135 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1135) .cse0) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1134) .cse0) .cse1)))) (forall ((v_ArrVal_1135 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1135) .cse0) .cse1))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32))))))) is different from false [2024-11-27 20:09:38,861 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (and (forall ((v_ArrVal_1134 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1135 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1135) .cse1) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1134) .cse1) .cse2)))) (forall ((v_ArrVal_1135 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1135) .cse1) .cse2))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3))))))) is different from false [2024-11-27 20:09:39,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:09:39,076 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 101 treesize of output 102 [2024-11-27 20:09:39,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:09:39,095 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 91 treesize of output 92 [2024-11-27 20:09:39,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:09:39,152 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 186 treesize of output 185 [2024-11-27 20:09:39,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:09:39,231 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 288 treesize of output 257 [2024-11-27 20:09:39,242 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 39 treesize of output 23 [2024-11-27 20:09:39,248 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 23 treesize of output 7 [2024-11-27 20:09:39,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:09:39,586 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 101 treesize of output 92 [2024-11-27 20:09:39,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:09:39,696 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 158 treesize of output 127 [2024-11-27 20:09:39,707 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 39 treesize of output 7 [2024-11-27 20:09:41,344 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 51 treesize of output 39 [2024-11-27 20:09:41,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2024-11-27 20:09:42,674 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 20:09:42,675 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:09:42,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110923687] [2024-11-27 20:09:42,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110923687] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:09:42,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:09:42,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2024-11-27 20:09:42,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482028507] [2024-11-27 20:09:42,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:09:42,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-27 20:09:42,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:09:42,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-27 20:09:42,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=851, Unknown=2, NotChecked=118, Total=1056 [2024-11-27 20:09:42,678 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 33 states, 32 states have (on average 2.5625) internal successors, (82), 33 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:48,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:48,547 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2024-11-27 20:09:48,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-27 20:09:48,548 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.5625) internal successors, (82), 33 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-27 20:09:48,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:48,549 INFO L225 Difference]: With dead ends: 100 [2024-11-27 20:09:48,549 INFO L226 Difference]: Without dead ends: 100 [2024-11-27 20:09:48,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=144, Invalid=1344, Unknown=2, NotChecked=150, Total=1640 [2024-11-27 20:09:48,550 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 92 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:48,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 531 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 889 Invalid, 0 Unknown, 139 Unchecked, 4.7s Time] [2024-11-27 20:09:48,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-27 20:09:48,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2024-11-27 20:09:48,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 86 states have (on average 1.197674418604651) 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-11-27 20:09:48,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2024-11-27 20:09:48,558 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 47 [2024-11-27 20:09:48,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:48,558 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2024-11-27 20:09:48,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.5625) internal successors, (82), 33 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:48,559 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2024-11-27 20:09:48,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-27 20:09:48,560 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:48,560 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:48,574 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-27 20:09:48,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:48,761 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 20:09:48,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:48,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1834657435, now seen corresponding path program 1 times [2024-11-27 20:09:48,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:09:48,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [587247340] [2024-11-27 20:09:48,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:48,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:48,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:48,764 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:48,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-27 20:09:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:49,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-27 20:09:49,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:49,134 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-27 20:09:49,134 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 17 treesize of output 17 [2024-11-27 20:09:49,491 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-11-27 20:09:49,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:09:49,743 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 28 treesize of output 15 [2024-11-27 20:09:49,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 20:09:49,886 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 54 treesize of output 27 [2024-11-27 20:09:49,979 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 39 treesize of output 23 [2024-11-27 20:09:50,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-27 20:09:50,240 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-27 20:09:50,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:09:50,466 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 72 treesize of output 68 [2024-11-27 20:09:50,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:09:50,740 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 62 treesize of output 108 [2024-11-27 20:09:51,052 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (forall ((v_arrayElimCell_57 (_ BitVec 32)) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1227))) (let ((.cse12 (select (select .cse11 .cse5) (bvadd (_ bv4 32) v_arrayElimCell_57)))) (or (= (select (select .cse11 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse6) .cse12) (= |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| .cse12)))))) (.cse1 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse2 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (and (or .cse0 .cse1) (or .cse0 .cse2) (or (not .cse1) (forall ((v_arrayElimCell_57 (_ BitVec 32)) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1227))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse6))) (or (= .cse3 (select (select .cse4 .cse5) (bvadd (_ bv4 32) v_arrayElimCell_57))) (= .cse3 |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|))))) (not .cse2)) (forall ((v_arrayElimCell_57 (_ BitVec 32)) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1227))) (or (= |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| (select (select .cse7 .cse5) (bvadd (_ bv4 32) v_arrayElimCell_57))) (= (select (select .cse7 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse6) |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|)))) (forall ((v_arrayElimCell_57 (_ BitVec 32)) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1227))) (let ((.cse9 (select (select .cse10 .cse5) (bvadd (_ bv4 32) v_arrayElimCell_57))) (.cse8 (select (select .cse10 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse6))) (or (= .cse8 .cse9) (= |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| .cse9) (= .cse8 |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|)))))))) is different from false [2024-11-27 20:09:51,206 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse8 (forall ((v_arrayElimCell_57 (_ BitVec 32)) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1227))) (let ((.cse13 (select (select .cse12 .cse4) (bvadd (_ bv4 32) v_arrayElimCell_57)))) (or (= (select (select .cse12 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse5) .cse13) (= .cse0 .cse13)))))) (.cse7 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse9 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (and (forall ((v_arrayElimCell_57 (_ BitVec 32)) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1227))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse5)) (.cse2 (select (select .cse3 .cse4) (bvadd (_ bv4 32) v_arrayElimCell_57)))) (or (= .cse0 .cse1) (= .cse1 .cse2) (= .cse0 .cse2))))) (forall ((v_arrayElimCell_57 (_ BitVec 32)) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1227))) (or (= .cse0 (select (select .cse6 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse5)) (= .cse0 (select (select .cse6 .cse4) (bvadd (_ bv4 32) v_arrayElimCell_57)))))) (or .cse7 .cse8) (or .cse9 .cse8) (or (not .cse7) (forall ((v_arrayElimCell_57 (_ BitVec 32)) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1227))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse5))) (or (= .cse0 .cse10) (= .cse10 (select (select .cse11 .cse4) (bvadd (_ bv4 32) v_arrayElimCell_57))))))) (not .cse9))))) is different from false [2024-11-27 20:09:51,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:09:51,656 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 88 treesize of output 68 [2024-11-27 20:09:52,198 INFO L349 Elim1Store]: treesize reduction 4, result has 73.3 percent of original size [2024-11-27 20:09:52,199 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 185 treesize of output 148 [2024-11-27 20:09:52,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:09:52,233 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 113 treesize of output 101 [2024-11-27 20:09:52,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:09:52,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 55 [2024-11-27 20:09:52,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:09:52,387 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 105 treesize of output 98 [2024-11-27 20:09:52,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:09:52,418 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 43 treesize of output 43 [2024-11-27 20:09:52,517 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-27 20:09:52,518 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 84 treesize of output 1 [2024-11-27 20:09:52,530 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-27 20:09:52,531 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 118 treesize of output 1 [2024-11-27 20:09:52,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:09:52,552 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 88 treesize of output 68 [2024-11-27 20:09:52,560 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:09:52,598 INFO L349 Elim1Store]: treesize reduction 4, result has 73.3 percent of original size [2024-11-27 20:09:52,598 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 121 treesize of output 94 [2024-11-27 20:09:52,619 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 43 treesize of output 35 [2024-11-27 20:09:52,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-27 20:09:53,046 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-27 20:09:53,046 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:09:53,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587247340] [2024-11-27 20:09:53,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587247340] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:09:53,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:09:53,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 27 [2024-11-27 20:09:53,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534542191] [2024-11-27 20:09:53,047 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:09:53,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-27 20:09:53,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:09:53,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-27 20:09:53,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=584, Unknown=2, NotChecked=98, Total=756 [2024-11-27 20:09:53,049 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 28 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:56,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:56,132 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2024-11-27 20:09:56,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-27 20:09:56,133 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 28 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-27 20:09:56,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:56,134 INFO L225 Difference]: With dead ends: 100 [2024-11-27 20:09:56,134 INFO L226 Difference]: Without dead ends: 100 [2024-11-27 20:09:56,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=119, Invalid=943, Unknown=2, NotChecked=126, Total=1190 [2024-11-27 20:09:56,140 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 75 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:56,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 520 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 822 Invalid, 0 Unknown, 127 Unchecked, 2.5s Time] [2024-11-27 20:09:56,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-27 20:09:56,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2024-11-27 20:09:56,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 86 states have (on average 1.186046511627907) internal successors, (102), 95 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:56,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2024-11-27 20:09:56,148 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 47 [2024-11-27 20:09:56,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:56,148 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2024-11-27 20:09:56,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 28 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:56,149 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2024-11-27 20:09:56,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-27 20:09:56,149 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:56,150 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:56,166 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-27 20:09:56,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:56,353 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 20:09:56,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:56,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1039813471, now seen corresponding path program 1 times [2024-11-27 20:09:56,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:09:56,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1476332532] [2024-11-27 20:09:56,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:56,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:56,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:56,356 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:56,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-27 20:09:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-27 20:09:56,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:56,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:09:56,770 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-27 20:09:56,771 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 17 treesize of output 17 [2024-11-27 20:09:56,938 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-11-27 20:09:57,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-27 20:09:57,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:09:57,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-27 20:09:57,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 20:09:57,572 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-11-27 20:09:57,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-27 20:09:57,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-27 20:09:57,765 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 20:09:57,765 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:09:57,765 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:09:57,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476332532] [2024-11-27 20:09:57,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476332532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:57,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:57,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-27 20:09:57,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251539374] [2024-11-27 20:09:57,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:57,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-27 20:09:57,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:09:57,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-27 20:09:57,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-27 20:09:57,767 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 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-11-27 20:09:59,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:59,431 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2024-11-27 20:09:59,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-27 20:09:59,432 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 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 48 [2024-11-27 20:09:59,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:59,433 INFO L225 Difference]: With dead ends: 100 [2024-11-27 20:09:59,433 INFO L226 Difference]: Without dead ends: 100 [2024-11-27 20:09:59,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2024-11-27 20:09:59,434 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 53 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:59,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 335 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-27 20:09:59,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-27 20:09:59,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2024-11-27 20:09:59,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 86 states have (on average 1.1744186046511629) internal successors, (101), 95 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2024-11-27 20:09:59,438 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 48 [2024-11-27 20:09:59,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:59,439 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2024-11-27 20:09:59,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 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-11-27 20:09:59,439 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2024-11-27 20:09:59,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-27 20:09:59,440 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:59,440 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:59,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-11-27 20:09:59,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:59,641 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 20:09:59,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:59,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1476643564, now seen corresponding path program 1 times [2024-11-27 20:09:59,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:09:59,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1586335638] [2024-11-27 20:09:59,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:59,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:59,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:59,644 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:59,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-27 20:09:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:59,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-27 20:09:59,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:10:00,085 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-27 20:10:00,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-27 20:10:00,440 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-11-27 20:10:00,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:10:00,738 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 28 treesize of output 15 [2024-11-27 20:10:00,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 20:10:00,804 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 51 treesize of output 24 [2024-11-27 20:10:00,874 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 36 treesize of output 20 [2024-11-27 20:10:00,993 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 24 treesize of output 12 [2024-11-27 20:10:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 20:10:01,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:10:01,281 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-11-27 20:10:01,475 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse0 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (and (or (forall ((v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_1413 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1413) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) v_arrayElimCell_86))))) (and .cse0 .cse1)) (or (not .cse1) (forall ((v_ArrVal_1413 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1413) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)) (_ bv0 32)))) (not .cse0)))) is different from false [2024-11-27 20:10:01,507 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse2 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (and (or (not .cse0) (forall ((v_ArrVal_1413 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_1413) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|))))) (not .cse2)) (or (forall ((v_arrayElimCell_86 (_ BitVec 32)) (v_ArrVal_1413 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_1413) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) v_arrayElimCell_86))))) (and .cse2 .cse0)))) is different from false [2024-11-27 20:10:01,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:10:01,614 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 27 treesize of output 28 [2024-11-27 20:10:01,619 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 47 treesize of output 35 [2024-11-27 20:10:01,634 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 8 treesize of output 4 [2024-11-27 20:10:01,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:10:01,659 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 31 treesize of output 32 [2024-11-27 20:10:01,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:10:01,689 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 59 treesize of output 58 [2024-11-27 20:10:01,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-11-27 20:10:02,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-27 20:10:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 20:10:02,442 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:10:02,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586335638] [2024-11-27 20:10:02,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586335638] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:10:02,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:10:02,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 31 [2024-11-27 20:10:02,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824655118] [2024-11-27 20:10:02,443 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:10:02,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-27 20:10:02,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:10:02,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-27 20:10:02,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=739, Unknown=2, NotChecked=110, Total=930 [2024-11-27 20:10:02,445 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 31 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 31 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:05,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:10:05,632 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2024-11-27 20:10:05,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-27 20:10:05,633 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 31 states have internal predecessors, (78), 0 states have call successors, (0), 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 50 [2024-11-27 20:10:05,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:10:05,634 INFO L225 Difference]: With dead ends: 96 [2024-11-27 20:10:05,634 INFO L226 Difference]: Without dead ends: 96 [2024-11-27 20:10:05,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=140, Invalid=1198, Unknown=2, NotChecked=142, Total=1482 [2024-11-27 20:10:05,635 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 41 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-27 20:10:05,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 783 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 880 Invalid, 0 Unknown, 121 Unchecked, 2.6s Time] [2024-11-27 20:10:05,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-27 20:10:05,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-27 20:10:05,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 95 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:05,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2024-11-27 20:10:05,639 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 50 [2024-11-27 20:10:05,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:10:05,639 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2024-11-27 20:10:05,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 31 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:05,640 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2024-11-27 20:10:05,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-27 20:10:05,641 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:10:05,641 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2024-11-27 20:10:05,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-11-27 20:10:05,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:10:05,841 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-27 20:10:05,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:10:05,842 INFO L85 PathProgramCache]: Analyzing trace with hash -589501734, now seen corresponding path program 2 times [2024-11-27 20:10:05,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:10:05,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1978547515] [2024-11-27 20:10:05,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:10:05,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:10:05,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:10:05,845 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:10:05,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cdcf2de-95c4-4295-ac63-1f29a8a66e95/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-27 20:10:07,788 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:10:07,788 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:10:07,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-11-27 20:10:07,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:10:07,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:10:07,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:10:07,974 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-27 20:10:07,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-27 20:10:07,997 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 12 treesize of output 14 [2024-11-27 20:10:08,146 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-11-27 20:10:08,159 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-11-27 20:10:08,277 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 19 treesize of output 18 [2024-11-27 20:10:08,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-27 20:10:08,499 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 20:10:08,499 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 68 treesize of output 59 [2024-11-27 20:10:08,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 24 treesize of output 11 [2024-11-27 20:10:08,906 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-27 20:10:08,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-27 20:10:08,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 34 [2024-11-27 20:10:09,226 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 61 treesize of output 38 [2024-11-27 20:10:09,266 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 20 treesize of output 15 [2024-11-27 20:10:09,332 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-11-27 20:10:09,352 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 61 treesize of output 38 [2024-11-27 20:10:09,429 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-11-27 20:10:09,468 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 61 treesize of output 38 [2024-11-27 20:10:10,311 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 26 [2024-11-27 20:10:10,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 54 [2024-11-27 20:10:11,464 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:10:11,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:10:11,471 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-27 20:10:11,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 46 [2024-11-27 20:10:11,511 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:10:11,512 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:10:11,518 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-27 20:10:11,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 63 [2024-11-27 20:10:11,928 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 147 treesize of output 91 [2024-11-27 20:10:11,998 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-11-27 20:10:12,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-27 20:10:14,121 INFO L349 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2024-11-27 20:10:14,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 91 treesize of output 52 [2024-11-27 20:10:14,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-27 20:10:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:10:14,800 INFO L312 TraceCheckSpWp]: Computing backward predicates...