./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 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 19:00:02,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 19:00:02,867 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 19:00:02,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 19:00:02,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 19:00:02,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 19:00:02,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 19:00:02,904 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 19:00:02,905 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 19:00:02,906 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 19:00:02,907 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 19:00:02,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 19:00:02,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 19:00:02,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 19:00:02,909 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 19:00:02,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 19:00:02,910 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 19:00:02,910 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 19:00:02,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 19:00:02,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 19:00:02,914 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 19:00:02,914 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 19:00:02,915 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 19:00:02,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 19:00:02,915 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 19:00:02,915 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 19:00:02,916 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 19:00:02,916 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 19:00:02,916 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 19:00:02,916 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 19:00:02,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 19:00:02,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 19:00:02,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 19:00:02,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 19:00:02,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 19:00:02,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 19:00:02,918 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 19:00:02,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 19:00:02,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 19:00:02,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 19:00:02,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 19:00:02,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 19:00:02,921 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-22 19:00:03,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 19:00:03,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 19:00:03,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 19:00:03,243 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 19:00:03,243 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 19:00:03,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2024-11-22 19:00:04,683 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 19:00:04,935 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 19:00:04,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2024-11-22 19:00:04,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f44ea6b9/b3038049c25e4a5aaca45bb85753b2e9/FLAG805facc28 [2024-11-22 19:00:05,258 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f44ea6b9/b3038049c25e4a5aaca45bb85753b2e9 [2024-11-22 19:00:05,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 19:00:05,261 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 19:00:05,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 19:00:05,262 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 19:00:05,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 19:00:05,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:00:05" (1/1) ... [2024-11-22 19:00:05,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ace663c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:05, skipping insertion in model container [2024-11-22 19:00:05,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:00:05" (1/1) ... [2024-11-22 19:00:05,320 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 19:00:05,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 19:00:05,631 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 19:00:05,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 19:00:05,727 INFO L204 MainTranslator]: Completed translation [2024-11-22 19:00:05,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:05 WrapperNode [2024-11-22 19:00:05,727 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 19:00:05,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 19:00:05,728 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 19:00:05,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 19:00:05,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:05" (1/1) ... [2024-11-22 19:00:05,748 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:05" (1/1) ... [2024-11-22 19:00:05,775 INFO L138 Inliner]: procedures = 127, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 121 [2024-11-22 19:00:05,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 19:00:05,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 19:00:05,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 19:00:05,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 19:00:05,786 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:05" (1/1) ... [2024-11-22 19:00:05,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:05" (1/1) ... [2024-11-22 19:00:05,790 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:05" (1/1) ... [2024-11-22 19:00:05,806 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-22 19:00:05,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:05" (1/1) ... [2024-11-22 19:00:05,807 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:05" (1/1) ... [2024-11-22 19:00:05,814 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:05" (1/1) ... [2024-11-22 19:00:05,818 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:05" (1/1) ... [2024-11-22 19:00:05,819 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:05" (1/1) ... [2024-11-22 19:00:05,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:05" (1/1) ... [2024-11-22 19:00:05,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 19:00:05,825 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 19:00:05,825 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 19:00:05,826 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 19:00:05,826 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:05" (1/1) ... [2024-11-22 19:00:05,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 19:00:05,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:00:05,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 19:00:05,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 19:00:05,918 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-22 19:00:05,918 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-22 19:00:05,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 19:00:05,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 19:00:05,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 19:00:05,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 19:00:05,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 19:00:05,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 19:00:05,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 19:00:05,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 19:00:05,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 19:00:05,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 19:00:05,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 19:00:05,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-22 19:00:05,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 19:00:05,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 19:00:05,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-22 19:00:05,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 19:00:05,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-22 19:00:05,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-22 19:00:05,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-22 19:00:05,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 19:00:05,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 19:00:05,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 19:00:05,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 19:00:05,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 19:00:06,051 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 19:00:06,053 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 19:00:06,078 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-22 19:00:06,411 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-22 19:00:06,411 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 19:00:06,427 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 19:00:06,428 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-22 19:00:06,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:00:06 BoogieIcfgContainer [2024-11-22 19:00:06,428 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 19:00:06,431 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 19:00:06,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 19:00:06,435 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 19:00:06,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 07:00:05" (1/3) ... [2024-11-22 19:00:06,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6622afcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:00:06, skipping insertion in model container [2024-11-22 19:00:06,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:05" (2/3) ... [2024-11-22 19:00:06,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6622afcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:00:06, skipping insertion in model container [2024-11-22 19:00:06,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:00:06" (3/3) ... [2024-11-22 19:00:06,437 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal.i [2024-11-22 19:00:06,474 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 19:00:06,475 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-11-22 19:00:06,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 19:00:06,561 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;@1d85b669, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 19:00:06,562 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-11-22 19:00:06,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 53 states have (on average 2.018867924528302) internal successors, (107), 95 states have internal predecessors, (107), 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-22 19:00:06,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 19:00:06,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:06,572 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 19:00:06,573 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-22 19:00:06,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:06,577 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2024-11-22 19:00:06,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:06,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340559655] [2024-11-22 19:00:06,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:06,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:06,824 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-22 19:00:06,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:06,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340559655] [2024-11-22 19:00:06,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340559655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:00:06,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:00:06,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 19:00:06,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975199836] [2024-11-22 19:00:06,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:00:06,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:00:06,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:06,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:00:06,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:00:06,858 INFO L87 Difference]: Start difference. First operand has 97 states, 53 states have (on average 2.018867924528302) internal successors, (107), 95 states have internal predecessors, (107), 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 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:00:06,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:06,965 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2024-11-22 19:00:06,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:00:06,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-22 19:00:06,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:06,976 INFO L225 Difference]: With dead ends: 93 [2024-11-22 19:00:06,976 INFO L226 Difference]: Without dead ends: 87 [2024-11-22 19:00:06,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:00:06,983 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 9 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 137 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-22 19:00:06,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 137 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:00:07,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-22 19:00:07,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-22 19:00:07,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 86 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-22 19:00:07,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-11-22 19:00:07,016 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 5 [2024-11-22 19:00:07,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:07,016 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-11-22 19:00:07,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:00:07,016 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-11-22 19:00:07,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 19:00:07,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:07,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 19:00:07,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 19:00:07,017 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-22 19:00:07,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:07,018 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2024-11-22 19:00:07,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:07,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028467062] [2024-11-22 19:00:07,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:07,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:07,160 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-22 19:00:07,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:07,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028467062] [2024-11-22 19:00:07,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028467062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:00:07,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:00:07,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 19:00:07,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402668068] [2024-11-22 19:00:07,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:00:07,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:00:07,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:07,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:00:07,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:00:07,165 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:00:07,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:07,251 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2024-11-22 19:00:07,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:00:07,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-22 19:00:07,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:07,252 INFO L225 Difference]: With dead ends: 84 [2024-11-22 19:00:07,252 INFO L226 Difference]: Without dead ends: 84 [2024-11-22 19:00:07,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:00:07,254 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 129 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-22 19:00:07,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 129 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:00:07,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-22 19:00:07,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-22 19:00:07,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.816326530612245) internal successors, (89), 83 states have internal predecessors, (89), 0 states have call successors, (0), 0 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-22 19:00:07,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2024-11-22 19:00:07,265 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 5 [2024-11-22 19:00:07,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:07,265 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2024-11-22 19:00:07,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:00:07,265 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2024-11-22 19:00:07,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-22 19:00:07,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:07,266 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:07,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 19:00:07,266 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-22 19:00:07,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:07,269 INFO L85 PathProgramCache]: Analyzing trace with hash 2100113040, now seen corresponding path program 1 times [2024-11-22 19:00:07,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:07,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144539299] [2024-11-22 19:00:07,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:07,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:07,335 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-22 19:00:07,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:07,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144539299] [2024-11-22 19:00:07,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144539299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:00:07,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:00:07,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:00:07,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259838180] [2024-11-22 19:00:07,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:00:07,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:00:07,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:07,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:00:07,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:00:07,338 INFO L87 Difference]: Start difference. First operand 84 states and 89 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-22 19:00:07,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:07,352 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2024-11-22 19:00:07,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:00:07,353 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-22 19:00:07,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:07,354 INFO L225 Difference]: With dead ends: 94 [2024-11-22 19:00:07,354 INFO L226 Difference]: Without dead ends: 94 [2024-11-22 19:00:07,355 INFO L431 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-22 19:00:07,356 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 10 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 171 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-22 19:00:07,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:00:07,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-22 19:00:07,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2024-11-22 19:00:07,362 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-22 19:00:07,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-11-22 19:00:07,363 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 7 [2024-11-22 19:00:07,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:07,364 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-11-22 19:00:07,364 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-22 19:00:07,364 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-11-22 19:00:07,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-22 19:00:07,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:07,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:07,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 19:00:07,365 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-22 19:00:07,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:07,366 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2024-11-22 19:00:07,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:07,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882214328] [2024-11-22 19:00:07,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:07,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:07,451 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-22 19:00:07,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:07,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882214328] [2024-11-22 19:00:07,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882214328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:00:07,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:00:07,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:00:07,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203509827] [2024-11-22 19:00:07,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:00:07,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:00:07,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:07,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:00:07,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:00:07,454 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:00:07,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:07,477 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2024-11-22 19:00:07,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:00:07,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-22 19:00:07,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:07,480 INFO L225 Difference]: With dead ends: 90 [2024-11-22 19:00:07,481 INFO L226 Difference]: Without dead ends: 90 [2024-11-22 19:00:07,481 INFO L431 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-22 19:00:07,482 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 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-22 19:00:07,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:00:07,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-22 19:00:07,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-22 19:00:07,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.7272727272727273) 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-22 19:00:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2024-11-22 19:00:07,492 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 9 [2024-11-22 19:00:07,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:07,493 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2024-11-22 19:00:07,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:00:07,493 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2024-11-22 19:00:07,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 19:00:07,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:07,494 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:07,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 19:00:07,494 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-22 19:00:07,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:07,495 INFO L85 PathProgramCache]: Analyzing trace with hash -763066913, now seen corresponding path program 1 times [2024-11-22 19:00:07,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:07,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733354346] [2024-11-22 19:00:07,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:07,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:07,631 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-22 19:00:07,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:07,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733354346] [2024-11-22 19:00:07,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733354346] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:00:07,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147266589] [2024-11-22 19:00:07,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:07,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:00:07,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:00:07,636 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:00:07,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 19:00:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:07,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 19:00:07,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:00:07,864 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-22 19:00:07,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:00:07,895 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-22 19:00:07,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147266589] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 19:00:07,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 19:00:07,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-22 19:00:07,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246224155] [2024-11-22 19:00:07,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 19:00:07,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 19:00:07,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:07,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 19:00:07,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-22 19:00:07,898 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:00:07,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:07,917 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2024-11-22 19:00:07,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 19:00:07,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-22 19:00:07,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:07,918 INFO L225 Difference]: With dead ends: 92 [2024-11-22 19:00:07,918 INFO L226 Difference]: Without dead ends: 92 [2024-11-22 19:00:07,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 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-22 19:00:07,920 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 10 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 246 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-22 19:00:07,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 246 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:00:07,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-22 19:00:07,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-22 19:00:07,925 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-22 19:00:07,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2024-11-22 19:00:07,926 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 14 [2024-11-22 19:00:07,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:07,926 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2024-11-22 19:00:07,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:00:07,926 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2024-11-22 19:00:07,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 19:00:07,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:07,927 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:07,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 19:00:08,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:00:08,132 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-22 19:00:08,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:08,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2024-11-22 19:00:08,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:08,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199517972] [2024-11-22 19:00:08,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:08,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:00:08,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:08,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199517972] [2024-11-22 19:00:08,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199517972] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:00:08,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048598335] [2024-11-22 19:00:08,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:08,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:00:08,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:00:08,341 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:00:08,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 19:00:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:08,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 19:00:08,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:00:08,466 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-22 19:00:08,506 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-22 19:00:08,507 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-22 19:00:08,533 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:00:08,533 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:00:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:00:08,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048598335] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 19:00:08,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 19:00:08,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-22 19:00:08,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092191998] [2024-11-22 19:00:08,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 19:00:08,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 19:00:08,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:08,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 19:00:08,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 19:00:08,577 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 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-22 19:00:08,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:08,691 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2024-11-22 19:00:08,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 19:00:08,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-22 19:00:08,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:08,693 INFO L225 Difference]: With dead ends: 91 [2024-11-22 19:00:08,693 INFO L226 Difference]: Without dead ends: 91 [2024-11-22 19:00:08,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 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-22 19:00:08,694 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 5 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 162 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.1s IncrementalHoareTripleChecker+Time [2024-11-22 19:00:08,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 162 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:00:08,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-22 19:00:08,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-22 19:00:08,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.6842105263157894) 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-22 19:00:08,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2024-11-22 19:00:08,699 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 16 [2024-11-22 19:00:08,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:08,699 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2024-11-22 19:00:08,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 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-22 19:00:08,700 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2024-11-22 19:00:08,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 19:00:08,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:08,700 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:08,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 19:00:08,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-22 19:00:08,905 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-22 19:00:08,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:08,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2024-11-22 19:00:08,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:08,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231991784] [2024-11-22 19:00:08,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:08,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:00:09,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:09,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231991784] [2024-11-22 19:00:09,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231991784] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:00:09,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022511256] [2024-11-22 19:00:09,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:09,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:00:09,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:00:09,158 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:00:09,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 19:00:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:09,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-22 19:00:09,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:00:09,295 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-22 19:00:09,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 6 treesize of output 5 [2024-11-22 19:00:09,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:00:09,380 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-22 19:00:09,390 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 19:00:09,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 11 treesize of output 11 [2024-11-22 19:00:09,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:00:09,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:00:09,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:00:09,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022511256] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 19:00:09,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 19:00:09,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2024-11-22 19:00:09,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906064590] [2024-11-22 19:00:09,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 19:00:09,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 19:00:09,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:09,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 19:00:09,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-22 19:00:09,700 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 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-22 19:00:09,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:09,903 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2024-11-22 19:00:09,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 19:00:09,903 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 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 16 [2024-11-22 19:00:09,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:09,904 INFO L225 Difference]: With dead ends: 90 [2024-11-22 19:00:09,904 INFO L226 Difference]: Without dead ends: 90 [2024-11-22 19:00:09,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-22 19:00:09,915 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 18 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 19:00:09,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 299 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 19:00:09,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-22 19:00:09,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-22 19:00:09,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.6666666666666667) 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-22 19:00:09,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2024-11-22 19:00:09,920 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 16 [2024-11-22 19:00:09,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:09,920 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2024-11-22 19:00:09,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 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-22 19:00:09,920 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2024-11-22 19:00:09,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 19:00:09,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:09,921 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:09,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-22 19:00:10,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:00:10,126 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-22 19:00:10,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:10,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957328, now seen corresponding path program 2 times [2024-11-22 19:00:10,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:10,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815211489] [2024-11-22 19:00:10,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 19:00:10,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:10,146 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 19:00:10,146 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 19:00:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-22 19:00:10,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:10,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815211489] [2024-11-22 19:00:10,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815211489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:00:10,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:00:10,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 19:00:10,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632791089] [2024-11-22 19:00:10,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:00:10,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:00:10,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:10,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:00:10,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:00:10,164 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:00:10,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:10,218 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-11-22 19:00:10,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:00:10,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-22 19:00:10,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:10,220 INFO L225 Difference]: With dead ends: 87 [2024-11-22 19:00:10,220 INFO L226 Difference]: Without dead ends: 87 [2024-11-22 19:00:10,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:00:10,221 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 117 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-22 19:00:10,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 117 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:00:10,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-22 19:00:10,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-22 19:00:10,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.6140350877192982) internal successors, (92), 86 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-22 19:00:10,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-11-22 19:00:10,225 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 21 [2024-11-22 19:00:10,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:10,225 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-11-22 19:00:10,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:00:10,225 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-11-22 19:00:10,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 19:00:10,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:10,226 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:10,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 19:00:10,227 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-22 19:00:10,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:10,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957327, now seen corresponding path program 1 times [2024-11-22 19:00:10,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:10,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532793087] [2024-11-22 19:00:10,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:10,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:10,299 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:00:10,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:10,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532793087] [2024-11-22 19:00:10,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532793087] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:00:10,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183315720] [2024-11-22 19:00:10,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:10,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:00:10,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:00:10,302 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:00:10,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 19:00:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:10,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 19:00:10,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:00:10,430 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:00:10,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:00:10,453 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:00:10,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183315720] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 19:00:10,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 19:00:10,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-22 19:00:10,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892526834] [2024-11-22 19:00:10,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 19:00:10,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 19:00:10,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:10,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 19:00:10,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 19:00:10,455 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-22 19:00:10,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:10,485 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2024-11-22 19:00:10,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 19:00:10,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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 21 [2024-11-22 19:00:10,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:10,486 INFO L225 Difference]: With dead ends: 87 [2024-11-22 19:00:10,487 INFO L226 Difference]: Without dead ends: 87 [2024-11-22 19:00:10,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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-22 19:00:10,487 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 221 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-22 19:00:10,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 221 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:00:10,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-22 19:00:10,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-22 19:00:10,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 86 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-22 19:00:10,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2024-11-22 19:00:10,491 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 21 [2024-11-22 19:00:10,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:10,492 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2024-11-22 19:00:10,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-22 19:00:10,492 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2024-11-22 19:00:10,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-22 19:00:10,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:10,493 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:10,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 19:00:10,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:00:10,693 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-22 19:00:10,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:10,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822092, now seen corresponding path program 1 times [2024-11-22 19:00:10,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:10,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674747594] [2024-11-22 19:00:10,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:10,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:10,785 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-22 19:00:10,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:10,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674747594] [2024-11-22 19:00:10,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674747594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:00:10,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:00:10,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 19:00:10,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107897963] [2024-11-22 19:00:10,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:00:10,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:00:10,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:10,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:00:10,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:00:10,791 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:00:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:10,842 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2024-11-22 19:00:10,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:00:10,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-22 19:00:10,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:10,844 INFO L225 Difference]: With dead ends: 84 [2024-11-22 19:00:10,844 INFO L226 Difference]: Without dead ends: 84 [2024-11-22 19:00:10,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:00:10,845 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 121 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.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:00:10,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 121 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:00:10,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-22 19:00:10,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-22 19:00:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.543859649122807) internal successors, (88), 83 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-22 19:00:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2024-11-22 19:00:10,848 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 22 [2024-11-22 19:00:10,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:10,848 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2024-11-22 19:00:10,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:00:10,848 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2024-11-22 19:00:10,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 19:00:10,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:10,849 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:10,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 19:00:10,850 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-22 19:00:10,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:10,850 INFO L85 PathProgramCache]: Analyzing trace with hash 157247510, now seen corresponding path program 1 times [2024-11-22 19:00:10,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:10,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410156218] [2024-11-22 19:00:10,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:10,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:11,137 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 19:00:11,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:11,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410156218] [2024-11-22 19:00:11,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410156218] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:00:11,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792625575] [2024-11-22 19:00:11,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:11,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:00:11,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:00:11,141 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:00:11,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 19:00:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:11,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-22 19:00:11,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:00:11,292 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-22 19:00:11,312 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 19:00:11,313 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-22 19:00:11,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:00:11,400 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 16 treesize of output 18 [2024-11-22 19:00:11,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:00:11,561 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2024-11-22 19:00:11,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 22 [2024-11-22 19:00:11,665 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:00:11,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:00:18,043 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_575 Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| Int)) (let ((.cse0 (store (store |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| v_ArrVal_575) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_33| 1))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_create_~new_head~0#1.base_33| 1)) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= (select .cse0 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34|) 1))))) is different from false [2024-11-22 19:00:18,063 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-22 19:00:18,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792625575] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 19:00:18,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 19:00:18,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-22 19:00:18,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645291093] [2024-11-22 19:00:18,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 19:00:18,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-22 19:00:18,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:18,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-22 19:00:18,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=177, Unknown=2, NotChecked=28, Total=272 [2024-11-22 19:00:18,064 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 17 states, 16 states have (on average 4.4375) internal successors, (71), 17 states have internal predecessors, (71), 0 states have call successors, (0), 0 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-22 19:00:18,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:18,274 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2024-11-22 19:00:18,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 19:00:18,275 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.4375) internal successors, (71), 17 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-22 19:00:18,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:18,277 INFO L225 Difference]: With dead ends: 90 [2024-11-22 19:00:18,277 INFO L226 Difference]: Without dead ends: 90 [2024-11-22 19:00:18,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=105, Invalid=239, Unknown=2, NotChecked=34, Total=380 [2024-11-22 19:00:18,278 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 279 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 19:00:18,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 125 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 144 Invalid, 0 Unknown, 82 Unchecked, 0.1s Time] [2024-11-22 19:00:18,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-22 19:00:18,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2024-11-22 19:00:18,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.4385964912280702) 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-22 19:00:18,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-11-22 19:00:18,283 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 27 [2024-11-22 19:00:18,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:18,284 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-11-22 19:00:18,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.4375) internal successors, (71), 17 states have internal predecessors, (71), 0 states have call successors, (0), 0 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-22 19:00:18,284 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-11-22 19:00:18,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 19:00:18,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:18,285 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:18,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 19:00:18,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-22 19:00:18,489 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-22 19:00:18,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:18,489 INFO L85 PathProgramCache]: Analyzing trace with hash 157247511, now seen corresponding path program 1 times [2024-11-22 19:00:18,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:18,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766226626] [2024-11-22 19:00:18,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:18,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:18,949 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:00:18,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:18,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766226626] [2024-11-22 19:00:18,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766226626] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:00:18,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440096068] [2024-11-22 19:00:18,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:18,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:00:18,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:00:18,952 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:00:18,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 19:00:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:19,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-22 19:00:19,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:00:19,105 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-22 19:00:19,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:00:19,136 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-22 19:00:19,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:00:19,186 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-22 19:00:19,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:00:19,255 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-22 19:00:19,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-22 19:00:19,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 19:00:19,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440096068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:00:19,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 19:00:19,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-22 19:00:19,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677015345] [2024-11-22 19:00:19,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:00:19,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 19:00:19,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:19,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 19:00:19,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-22 19:00:19,293 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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-22 19:00:19,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:19,374 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2024-11-22 19:00:19,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 19:00:19,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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 27 [2024-11-22 19:00:19,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:19,375 INFO L225 Difference]: With dead ends: 72 [2024-11-22 19:00:19,375 INFO L226 Difference]: Without dead ends: 72 [2024-11-22 19:00:19,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-22 19:00:19,376 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 52 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 19:00:19,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 88 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:00:19,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-22 19:00:19,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-22 19:00:19,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.3333333333333333) 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-22 19:00:19,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-11-22 19:00:19,378 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 27 [2024-11-22 19:00:19,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:19,379 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-11-22 19:00:19,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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-22 19:00:19,379 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-11-22 19:00:19,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 19:00:19,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:19,380 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:19,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-22 19:00:19,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:00:19,584 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-22 19:00:19,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:19,584 INFO L85 PathProgramCache]: Analyzing trace with hash 579705555, now seen corresponding path program 1 times [2024-11-22 19:00:19,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:19,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972720855] [2024-11-22 19:00:19,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:19,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:19,688 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-22 19:00:19,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:19,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972720855] [2024-11-22 19:00:19,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972720855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:00:19,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:00:19,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 19:00:19,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102737094] [2024-11-22 19:00:19,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:00:19,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 19:00:19,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:19,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 19:00:19,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 19:00:19,691 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:00:19,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:19,775 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2024-11-22 19:00:19,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 19:00:19,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-22 19:00:19,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:19,777 INFO L225 Difference]: With dead ends: 71 [2024-11-22 19:00:19,777 INFO L226 Difference]: Without dead ends: 71 [2024-11-22 19:00:19,778 INFO L431 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-22 19:00:19,778 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 11 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 150 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-22 19:00:19,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 150 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:00:19,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-22 19:00:19,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-22 19:00:19,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.3157894736842106) 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-22 19:00:19,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2024-11-22 19:00:19,782 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 28 [2024-11-22 19:00:19,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:19,782 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2024-11-22 19:00:19,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:00:19,783 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2024-11-22 19:00:19,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 19:00:19,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:19,784 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:19,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 19:00:19,784 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-22 19:00:19,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:19,786 INFO L85 PathProgramCache]: Analyzing trace with hash 579705556, now seen corresponding path program 1 times [2024-11-22 19:00:19,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:19,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733266457] [2024-11-22 19:00:19,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:19,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:19,946 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-22 19:00:19,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:19,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733266457] [2024-11-22 19:00:19,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733266457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:00:19,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:00:19,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 19:00:19,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154826361] [2024-11-22 19:00:19,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:00:19,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 19:00:19,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:19,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 19:00:19,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 19:00:19,948 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:00:20,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:20,021 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2024-11-22 19:00:20,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 19:00:20,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-22 19:00:20,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:20,022 INFO L225 Difference]: With dead ends: 70 [2024-11-22 19:00:20,022 INFO L226 Difference]: Without dead ends: 70 [2024-11-22 19:00:20,023 INFO L431 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-22 19:00:20,023 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 10 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 162 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-22 19:00:20,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 162 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:00:20,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-22 19:00:20,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-22 19:00:20,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.2982456140350878) 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-22 19:00:20,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2024-11-22 19:00:20,026 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 28 [2024-11-22 19:00:20,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:20,026 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2024-11-22 19:00:20,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:00:20,026 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2024-11-22 19:00:20,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-22 19:00:20,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:20,028 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:20,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 19:00:20,028 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-22 19:00:20,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:20,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1569558015, now seen corresponding path program 1 times [2024-11-22 19:00:20,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:20,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016564201] [2024-11-22 19:00:20,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:20,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:20,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 19:00:20,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:20,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016564201] [2024-11-22 19:00:20,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016564201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:00:20,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:00:20,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 19:00:20,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780822144] [2024-11-22 19:00:20,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:00:20,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 19:00:20,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:20,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 19:00:20,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 19:00:20,268 INFO L87 Difference]: Start difference. First operand 70 states and 74 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-22 19:00:20,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:20,417 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2024-11-22 19:00:20,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 19:00:20,418 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 33 [2024-11-22 19:00:20,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:20,418 INFO L225 Difference]: With dead ends: 69 [2024-11-22 19:00:20,418 INFO L226 Difference]: Without dead ends: 69 [2024-11-22 19:00:20,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-22 19:00:20,419 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 17 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 19:00:20,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 194 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:00:20,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-22 19:00:20,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-22 19:00:20,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 57 states have (on average 1.280701754385965) internal successors, (73), 68 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-22 19:00:20,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2024-11-22 19:00:20,421 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 33 [2024-11-22 19:00:20,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:20,422 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2024-11-22 19:00:20,422 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-22 19:00:20,422 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2024-11-22 19:00:20,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-22 19:00:20,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:20,423 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:20,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 19:00:20,423 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-22 19:00:20,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:20,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1569558014, now seen corresponding path program 1 times [2024-11-22 19:00:20,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:20,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131196971] [2024-11-22 19:00:20,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:20,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:20,768 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 19:00:20,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:20,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131196971] [2024-11-22 19:00:20,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131196971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:00:20,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:00:20,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 19:00:20,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434747114] [2024-11-22 19:00:20,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:00:20,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 19:00:20,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:20,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 19:00:20,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 19:00:20,770 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 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-22 19:00:20,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:20,922 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2024-11-22 19:00:20,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 19:00:20,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 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 33 [2024-11-22 19:00:20,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:20,924 INFO L225 Difference]: With dead ends: 68 [2024-11-22 19:00:20,924 INFO L226 Difference]: Without dead ends: 68 [2024-11-22 19:00:20,924 INFO L431 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-22 19:00:20,924 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 214 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.1s IncrementalHoareTripleChecker+Time [2024-11-22 19:00:20,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 214 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:00:20,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-22 19:00:20,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-22 19:00:20,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.263157894736842) internal successors, (72), 67 states have internal predecessors, (72), 0 states have call successors, (0), 0 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-22 19:00:20,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2024-11-22 19:00:20,926 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 33 [2024-11-22 19:00:20,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:20,927 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2024-11-22 19:00:20,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 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-22 19:00:20,927 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2024-11-22 19:00:20,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 19:00:20,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:20,929 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:20,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 19:00:20,929 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-22 19:00:20,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:20,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1306141903, now seen corresponding path program 1 times [2024-11-22 19:00:20,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:20,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187995630] [2024-11-22 19:00:20,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:20,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:21,114 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 19:00:21,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:21,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187995630] [2024-11-22 19:00:21,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187995630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:00:21,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:00:21,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 19:00:21,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102246789] [2024-11-22 19:00:21,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:00:21,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 19:00:21,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:21,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 19:00:21,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 19:00:21,117 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:00:21,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:21,219 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2024-11-22 19:00:21,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 19:00:21,219 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-22 19:00:21,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:21,220 INFO L225 Difference]: With dead ends: 68 [2024-11-22 19:00:21,220 INFO L226 Difference]: Without dead ends: 68 [2024-11-22 19:00:21,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-22 19:00:21,221 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 12 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 277 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-22 19:00:21,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 277 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:00:21,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-22 19:00:21,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-22 19:00:21,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 0 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-22 19:00:21,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2024-11-22 19:00:21,223 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 37 [2024-11-22 19:00:21,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:21,223 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2024-11-22 19:00:21,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:00:21,223 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2024-11-22 19:00:21,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-22 19:00:21,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:21,224 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:21,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 19:00:21,224 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-22 19:00:21,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:21,225 INFO L85 PathProgramCache]: Analyzing trace with hash -96972992, now seen corresponding path program 1 times [2024-11-22 19:00:21,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:21,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321653153] [2024-11-22 19:00:21,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:21,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:21,495 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-22 19:00:21,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:21,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321653153] [2024-11-22 19:00:21,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321653153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:00:21,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:00:21,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 19:00:21,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926287322] [2024-11-22 19:00:21,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:00:21,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 19:00:21,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:21,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 19:00:21,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-22 19:00:21,498 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 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-22 19:00:21,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:21,629 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2024-11-22 19:00:21,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 19:00:21,630 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 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 40 [2024-11-22 19:00:21,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:21,630 INFO L225 Difference]: With dead ends: 69 [2024-11-22 19:00:21,631 INFO L226 Difference]: Without dead ends: 69 [2024-11-22 19:00:21,631 INFO L431 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-22 19:00:21,631 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 24 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 19:00:21,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 151 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:00:21,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-22 19:00:21,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-22 19:00:21,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 68 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-22 19:00:21,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2024-11-22 19:00:21,634 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 40 [2024-11-22 19:00:21,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:21,635 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2024-11-22 19:00:21,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 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-22 19:00:21,635 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2024-11-22 19:00:21,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-22 19:00:21,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:21,636 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:21,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 19:00:21,636 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-22 19:00:21,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:21,636 INFO L85 PathProgramCache]: Analyzing trace with hash -96972991, now seen corresponding path program 1 times [2024-11-22 19:00:21,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:21,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733892747] [2024-11-22 19:00:21,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:21,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:22,010 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-22 19:00:22,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:22,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733892747] [2024-11-22 19:00:22,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733892747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:00:22,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:00:22,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 19:00:22,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458864632] [2024-11-22 19:00:22,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:00:22,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 19:00:22,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:22,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 19:00:22,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-22 19:00:22,012 INFO L87 Difference]: Start difference. First operand 69 states and 74 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-22 19:00:22,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:22,186 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2024-11-22 19:00:22,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 19:00:22,187 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 40 [2024-11-22 19:00:22,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:22,188 INFO L225 Difference]: With dead ends: 71 [2024-11-22 19:00:22,188 INFO L226 Difference]: Without dead ends: 71 [2024-11-22 19:00:22,188 INFO L431 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-22 19:00:22,189 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 24 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 19:00:22,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 212 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:00:22,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-22 19:00:22,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-22 19:00:22,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.2295081967213115) 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-22 19:00:22,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2024-11-22 19:00:22,193 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 40 [2024-11-22 19:00:22,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:22,193 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2024-11-22 19:00:22,193 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-22 19:00:22,193 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2024-11-22 19:00:22,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-22 19:00:22,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:22,194 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:22,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 19:00:22,194 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-22 19:00:22,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:22,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1589371212, now seen corresponding path program 1 times [2024-11-22 19:00:22,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:22,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455594505] [2024-11-22 19:00:22,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:22,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:22,433 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-22 19:00:22,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:22,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455594505] [2024-11-22 19:00:22,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455594505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:00:22,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:00:22,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 19:00:22,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166868969] [2024-11-22 19:00:22,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:00:22,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 19:00:22,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:22,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 19:00:22,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-22 19:00:22,435 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:00:22,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:22,546 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-11-22 19:00:22,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 19:00:22,547 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-22 19:00:22,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:22,547 INFO L225 Difference]: With dead ends: 71 [2024-11-22 19:00:22,547 INFO L226 Difference]: Without dead ends: 71 [2024-11-22 19:00:22,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-22 19:00:22,549 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 24 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 277 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-22 19:00:22,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 277 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:00:22,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-22 19:00:22,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-22 19:00:22,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 70 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-22 19:00:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2024-11-22 19:00:22,554 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 43 [2024-11-22 19:00:22,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:22,554 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2024-11-22 19:00:22,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:00:22,555 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2024-11-22 19:00:22,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-22 19:00:22,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:22,555 INFO L215 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-22 19:00:22,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-22 19:00:22,556 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-22 19:00:22,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:22,556 INFO L85 PathProgramCache]: Analyzing trace with hash -377366918, now seen corresponding path program 1 times [2024-11-22 19:00:22,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:22,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059257082] [2024-11-22 19:00:22,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:22,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 19:00:23,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:23,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059257082] [2024-11-22 19:00:23,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059257082] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:00:23,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928406346] [2024-11-22 19:00:23,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:23,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:00:23,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:00:23,422 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:00:23,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-22 19:00:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:23,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-22 19:00:23,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:00:23,682 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-22 19:00:23,823 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-22 19:00:23,823 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-22 19:00:24,031 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-22 19:00:24,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:00:24,199 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-22 19:00:24,275 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:00:24,277 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 42 [2024-11-22 19:00:24,284 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-22 19:00:24,383 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:00:24,384 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-22 19:00:24,389 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:00:24,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:24,392 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-22 19:00:24,469 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-22 19:00:24,497 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 19:00:24,497 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:00:24,618 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-22 19:00:24,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:24,735 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-22 19:00:24,878 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse8 (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (and (forall ((v_ArrVal_1515 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1515))) (let ((.cse1 (select (select .cse2 .cse4) (+ 4 v_arrayElimCell_20))) (.cse0 (select (select .cse2 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse3))) (or (= .cse0 .cse1) (= |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| .cse1) (= .cse0 |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|))))) (or (forall ((v_ArrVal_1515 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1515))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse3))) (or (= .cse5 (select (select .cse6 .cse4) (+ 4 v_arrayElimCell_20))) (= .cse5 |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|))))) (not .cse7) (not .cse8)) (or (and .cse7 .cse8) (forall ((v_ArrVal_1515 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1515))) (let ((.cse10 (select (select .cse9 .cse4) (+ 4 v_arrayElimCell_20)))) (or (= (select (select .cse9 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse3) .cse10) (= |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| .cse10)))))) (forall ((v_ArrVal_1515 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1515))) (or (= |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| (select (select .cse11 .cse4) (+ 4 v_arrayElimCell_20))) (= (select (select .cse11 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse3) |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|)))))) is different from false [2024-11-22 19:00:24,950 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse4 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse5 (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (forall ((v_ArrVal_1515 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse1 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1515))) (or (= .cse0 (select (select .cse1 .cse2) (+ 4 v_arrayElimCell_20))) (= (select (select .cse1 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse3) .cse0)))) (or (and .cse4 .cse5) (forall ((v_ArrVal_1515 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1515))) (let ((.cse6 (select (select .cse7 .cse2) (+ 4 v_arrayElimCell_20)))) (or (= .cse0 .cse6) (= (select (select .cse7 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse3) .cse6)))))) (forall ((v_ArrVal_1515 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1515))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse3)) (.cse8 (select (select .cse10 .cse2) (+ 4 v_arrayElimCell_20)))) (or (= .cse0 .cse8) (= .cse9 .cse0) (= .cse9 .cse8))))) (or (forall ((v_ArrVal_1515 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse12 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1515))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse3))) (or (= .cse11 .cse0) (= .cse11 (select (select .cse12 .cse2) (+ 4 v_arrayElimCell_20))))))) (not .cse4) (not .cse5)))) is different from false [2024-11-22 19:00:25,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:25,103 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 84 treesize of output 64 [2024-11-22 19:00:25,112 INFO L349 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2024-11-22 19:00:25,112 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 181 treesize of output 137 [2024-11-22 19:00:25,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:25,128 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 117 treesize of output 105 [2024-11-22 19:00:25,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:25,172 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-22 19:00:25,194 INFO L349 Elim1Store]: treesize reduction 4, result has 73.3 percent of original size [2024-11-22 19:00:25,194 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-22 19:00:25,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:25,208 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-22 19:00:25,262 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 19:00:25,262 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 1 [2024-11-22 19:00:25,269 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-22 19:00:25,269 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 1 [2024-11-22 19:00:25,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:25,514 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-22 19:00:25,825 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 19:00:25,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928406346] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 19:00:25,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 19:00:25,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 46 [2024-11-22 19:00:25,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888478322] [2024-11-22 19:00:25,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 19:00:25,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-22 19:00:25,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:25,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-22 19:00:25,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1845, Unknown=2, NotChecked=174, Total=2162 [2024-11-22 19:00:25,829 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 47 states, 46 states have (on average 2.5) internal successors, (115), 47 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-22 19:00:27,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:27,288 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2024-11-22 19:00:27,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-22 19:00:27,289 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.5) internal successors, (115), 47 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) Word has length 45 [2024-11-22 19:00:27,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:27,289 INFO L225 Difference]: With dead ends: 78 [2024-11-22 19:00:27,289 INFO L226 Difference]: Without dead ends: 78 [2024-11-22 19:00:27,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=285, Invalid=3261, Unknown=2, NotChecked=234, Total=3782 [2024-11-22 19:00:27,291 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 146 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 19:00:27,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 623 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1228 Invalid, 0 Unknown, 129 Unchecked, 0.7s Time] [2024-11-22 19:00:27,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-22 19:00:27,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2024-11-22 19:00:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.25) 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-22 19:00:27,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2024-11-22 19:00:27,293 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 45 [2024-11-22 19:00:27,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:27,293 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2024-11-22 19:00:27,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.5) internal successors, (115), 47 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-22 19:00:27,293 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2024-11-22 19:00:27,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-22 19:00:27,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:27,294 INFO L215 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-22 19:00:27,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-22 19:00:27,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:00:27,499 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-22 19:00:27,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:27,499 INFO L85 PathProgramCache]: Analyzing trace with hash -377366917, now seen corresponding path program 1 times [2024-11-22 19:00:27,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:27,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871284191] [2024-11-22 19:00:27,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:27,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:28,828 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 19:00:28,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:28,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871284191] [2024-11-22 19:00:28,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871284191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:00:28,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132913849] [2024-11-22 19:00:28,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:28,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:00:28,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:00:28,831 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:00:28,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-22 19:00:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:29,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-22 19:00:29,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:00:29,105 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-22 19:00:29,112 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-22 19:00:29,322 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-22 19:00:29,323 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-22 19:00:29,347 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-22 19:00:29,347 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-22 19:00:29,634 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-22 19:00:29,641 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-22 19:00:29,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:00:29,878 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-22 19:00:29,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:00:29,892 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-22 19:00:29,929 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:00:29,930 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-22 19:00:29,938 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:00:29,939 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 44 treesize of output 21 [2024-11-22 19:00:30,022 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:00:30,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 46 [2024-11-22 19:00:30,027 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:00:30,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:30,030 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 50 treesize of output 37 [2024-11-22 19:00:30,122 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-22 19:00:30,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-22 19:00:30,253 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 19:00:30,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:00:30,608 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 (+ (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|) 4))) (and (forall ((v_ArrVal_1697 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1697) .cse0) .cse1) 4))) (forall ((v_ArrVal_1698 (Array Int Int)) (v_ArrVal_1697 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1697) .cse0) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1698) .cse0) .cse1)))))) is different from false [2024-11-22 19:00:30,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:30,811 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-22 19:00:30,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:30,816 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-22 19:00:30,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:30,826 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-22 19:00:30,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:30,840 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-22 19:00:30,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2024-11-22 19:00:30,854 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 27 [2024-11-22 19:00:30,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:30,899 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 52 treesize of output 53 [2024-11-22 19:00:30,902 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:00:30,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:30,910 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 46 treesize of output 30 [2024-11-22 19:00:31,325 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 62 [2024-11-22 19:00:31,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:31,335 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 80 treesize of output 76 [2024-11-22 19:00:31,341 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 67 treesize of output 59 [2024-11-22 19:00:31,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:31,351 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 65 treesize of output 65 [2024-11-22 19:00:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 19:00:31,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132913849] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 19:00:31,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 19:00:31,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 51 [2024-11-22 19:00:31,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941779939] [2024-11-22 19:00:31,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 19:00:31,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-22 19:00:31,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:31,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-22 19:00:31,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2368, Unknown=28, NotChecked=98, Total=2652 [2024-11-22 19:00:31,829 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 52 states, 51 states have (on average 2.450980392156863) internal successors, (125), 52 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-22 19:00:33,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:33,564 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-11-22 19:00:33,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-22 19:00:33,565 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.450980392156863) internal successors, (125), 52 states have internal predecessors, (125), 0 states have call successors, (0), 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-22 19:00:33,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:33,565 INFO L225 Difference]: With dead ends: 80 [2024-11-22 19:00:33,565 INFO L226 Difference]: Without dead ends: 80 [2024-11-22 19:00:33,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=333, Invalid=4331, Unknown=32, NotChecked=134, Total=4830 [2024-11-22 19:00:33,567 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 130 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 19:00:33,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 689 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1232 Invalid, 0 Unknown, 69 Unchecked, 0.7s Time] [2024-11-22 19:00:33,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-22 19:00:33,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2024-11-22 19:00:33,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 75 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-22 19:00:33,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2024-11-22 19:00:33,568 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 45 [2024-11-22 19:00:33,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:33,569 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2024-11-22 19:00:33,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.450980392156863) internal successors, (125), 52 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-22 19:00:33,569 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2024-11-22 19:00:33,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-22 19:00:33,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:33,569 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:33,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-22 19:00:33,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-22 19:00:33,770 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-22 19:00:33,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:33,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1186516712, now seen corresponding path program 1 times [2024-11-22 19:00:33,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:33,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120079525] [2024-11-22 19:00:33,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:33,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:34,485 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 19:00:34,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:34,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120079525] [2024-11-22 19:00:34,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120079525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:00:34,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:00:34,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-22 19:00:34,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552008913] [2024-11-22 19:00:34,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:00:34,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 19:00:34,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:34,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 19:00:34,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-22 19:00:34,487 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:00:34,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:34,725 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2024-11-22 19:00:34,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 19:00:34,725 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-22 19:00:34,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:34,726 INFO L225 Difference]: With dead ends: 80 [2024-11-22 19:00:34,726 INFO L226 Difference]: Without dead ends: 80 [2024-11-22 19:00:34,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-22 19:00:34,727 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 30 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 19:00:34,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 345 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 19:00:34,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-22 19:00:34,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2024-11-22 19:00:34,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 75 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-22 19:00:34,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2024-11-22 19:00:34,729 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 46 [2024-11-22 19:00:34,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:34,729 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2024-11-22 19:00:34,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:00:34,729 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2024-11-22 19:00:34,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-22 19:00:34,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:34,729 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:34,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-22 19:00:34,730 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-22 19:00:34,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:34,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2085312466, now seen corresponding path program 1 times [2024-11-22 19:00:34,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:34,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617154103] [2024-11-22 19:00:34,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:34,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:35,554 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 19:00:35,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:35,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617154103] [2024-11-22 19:00:35,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617154103] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:00:35,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225367405] [2024-11-22 19:00:35,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:35,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:00:35,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:00:35,555 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:00:35,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-22 19:00:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:35,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-22 19:00:35,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:00:35,781 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-22 19:00:35,905 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-22 19:00:35,905 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-22 19:00:36,106 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-22 19:00:36,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:00:36,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 17 [2024-11-22 19:00:36,443 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:00:36,444 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 57 treesize of output 30 [2024-11-22 19:00:36,449 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:00:36,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-22 19:00:36,544 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:00:36,545 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 48 treesize of output 32 [2024-11-22 19:00:36,549 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:00:36,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:36,551 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 36 treesize of output 27 [2024-11-22 19:00:36,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2024-11-22 19:00:36,670 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 19:00:36,671 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:00:36,915 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1963 (Array Int Int))) (not (= (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (select (store |c_#memory_$Pointer$#2.base| (select .cse0 |c_ULTIMATE.start_dll_prepend_~head#1.offset|) v_ArrVal_1963) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse0 |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|))) (+ (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|) 4)) 0))) is different from false [2024-11-22 19:00:37,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:37,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 52 [2024-11-22 19:00:37,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:37,058 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 107 treesize of output 106 [2024-11-22 19:00:37,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2024-11-22 19:00:37,575 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 56 [2024-11-22 19:00:37,580 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 58 treesize of output 52 [2024-11-22 19:00:37,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:37,592 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 58 treesize of output 60 [2024-11-22 19:00:37,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:37,606 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 67 treesize of output 61 [2024-11-22 19:00:37,996 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 19:00:37,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225367405] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 19:00:37,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 19:00:37,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 51 [2024-11-22 19:00:37,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369232451] [2024-11-22 19:00:37,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 19:00:37,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-22 19:00:37,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:00:37,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-22 19:00:37,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2281, Unknown=10, NotChecked=96, Total=2550 [2024-11-22 19:00:37,999 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 51 states, 51 states have (on average 2.3529411764705883) internal successors, (120), 51 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-22 19:00:39,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:39,827 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2024-11-22 19:00:39,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-22 19:00:39,827 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.3529411764705883) internal successors, (120), 51 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 48 [2024-11-22 19:00:39,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:39,828 INFO L225 Difference]: With dead ends: 76 [2024-11-22 19:00:39,828 INFO L226 Difference]: Without dead ends: 76 [2024-11-22 19:00:39,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=376, Invalid=4588, Unknown=10, NotChecked=138, Total=5112 [2024-11-22 19:00:39,829 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 118 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 19:00:39,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 843 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1239 Invalid, 0 Unknown, 62 Unchecked, 0.8s Time] [2024-11-22 19:00:39,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-22 19:00:39,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-22 19:00:39,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.196969696969697) internal successors, (79), 75 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:00:39,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2024-11-22 19:00:39,832 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 48 [2024-11-22 19:00:39,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:39,832 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2024-11-22 19:00:39,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.3529411764705883) internal successors, (120), 51 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-22 19:00:39,832 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2024-11-22 19:00:39,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-22 19:00:39,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:39,833 INFO L215 NwaCegarLoop]: trace histogram [3, 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-22 19:00:39,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-22 19:00:40,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-22 19:00:40,034 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-22 19:00:40,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:40,034 INFO L85 PathProgramCache]: Analyzing trace with hash -519191680, now seen corresponding path program 2 times [2024-11-22 19:00:40,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:40,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796420388] [2024-11-22 19:00:40,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 19:00:40,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:40,088 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 19:00:40,090 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 19:00:41,908 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:00:41,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:41,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796420388] [2024-11-22 19:00:41,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796420388] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:00:41,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005496685] [2024-11-22 19:00:41,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 19:00:41,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:00:41,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:00:41,909 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:00:41,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-22 19:00:42,202 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 19:00:42,202 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 19:00:42,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-11-22 19:00:42,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:00:42,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 19:00:42,322 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 19:00:42,322 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-22 19:00:42,377 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-22 19:00:42,423 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-22 19:00:42,452 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 19:00:42,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-22 19:00:42,603 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2024-11-22 19:00:42,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 36 treesize of output 52 [2024-11-22 19:00:42,686 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-22 19:00:42,705 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-22 19:00:42,745 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-22 19:00:42,979 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-22 19:00:42,988 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-22 19:00:43,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:00:43,330 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:00:43,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:00:43,332 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 76 treesize of output 58 [2024-11-22 19:00:43,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:00:43,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 17 [2024-11-22 19:00:43,532 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:00:43,533 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 169 treesize of output 113 [2024-11-22 19:00:43,540 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:00:43,542 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:00:43,543 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-22 19:00:43,724 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:00:43,724 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 46 treesize of output 34 [2024-11-22 19:00:43,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 21 treesize of output 13 [2024-11-22 19:00:43,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2024-11-22 19:00:44,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:00:44,374 INFO L349 Elim1Store]: treesize reduction 44, result has 6.4 percent of original size [2024-11-22 19:00:44,374 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 87 treesize of output 38 [2024-11-22 19:00:44,700 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:00:44,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:00:45,056 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2155 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (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|)) (.cse2 (+ (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|) 4))) (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|) (+ |c_ULTIMATE.start_dll_prepend_#t~mem10#1.offset| 8) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_2155) .cse1) .cse2) 4)))) 1)) is different from false [2024-11-22 19:00:45,067 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int) (v_ArrVal_2155 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (or (= (select |c_#valid| (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse3 (select .cse5 |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 .cse5 |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 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |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.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| .cse3 (store (select |c_#memory_$Pointer$#2.base| .cse3) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| .cse3 v_ArrVal_2155) .cse1) .cse2)))))) 1) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| (select .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) is different from false [2024-11-22 19:00:45,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:45,105 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 164 treesize of output 165 [2024-11-22 19:00:45,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:45,122 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 332 treesize of output 331 [2024-11-22 19:00:45,130 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 153 treesize of output 137 [2024-11-22 19:00:49,405 WARN L873 $PredicateComparison]: unable to prove that (or (not (= (select |c_#valid| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) 1)) (let ((.cse30 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse4 (select .cse30 |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 .cse30 |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|))) (let ((.cse11 (= .cse1 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)) (.cse7 (= .cse1 .cse4)) (.cse14 (+ |c_ULTIMATE.start_dll_prepend_#t~mem8#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)) (.cse6 (select .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int) (v_arrayElimCell_103 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (or (= (select |c_#valid| (select (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base| (store .cse5 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_prepend_#t~mem8#1.base|)))) (store .cse3 .cse4 (store (select .cse3 .cse4) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse0 (select (select .cse0 .cse1) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|) 4)))) (+ v_arrayElimCell_103 4))) 1) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse6))) (not .cse7)) (or (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int) (v_arrayElimCell_102 Int) (v_arrayElimCell_103 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse8 (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base| (store .cse5 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_prepend_#t~mem8#1.base|)))) (store .cse10 .cse4 (store (select .cse10 .cse4) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse9 (select (select .cse9 .cse1) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|) 4)))))) (or (= (select |c_#valid| (select .cse8 (+ v_arrayElimCell_103 4))) 1) (= (select |c_#valid| (select .cse8 (+ v_arrayElimCell_102 4))) 1) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse6)))) .cse11) (or (and (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int)) (or (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (= (select |c_#valid| (select (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base| (store .cse5 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_prepend_#t~mem8#1.base|)))) (store .cse13 .cse4 (store (select .cse13 .cse4) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse12 (select (select .cse12 .cse1) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|) 4)))) .cse14)) 1)) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse6))) (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int)) (or (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse6) (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|))) (or (forall ((v_arrayElimCell_102 Int)) (= (select |c_#valid| (select (let ((.cse15 (let ((.cse17 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base| (store .cse5 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_prepend_#t~mem8#1.base|)))) (store .cse17 .cse4 (store (select .cse17 .cse4) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse15 (select (select .cse15 .cse1) (+ .cse16 4)))) (+ v_arrayElimCell_102 4))) 1)) (= |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| .cse16)))))) (or .cse11 (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int) (v_arrayElimCell_102 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (or (= (select |c_#valid| (select (let ((.cse18 (let ((.cse19 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base| (store .cse5 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_prepend_#t~mem8#1.base|)))) (store .cse19 .cse4 (store (select .cse19 .cse4) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse18 (select (select .cse18 .cse1) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|) 4)))) (+ v_arrayElimCell_102 4))) 1) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse6))))) .cse7) (or (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int) (v_arrayElimCell_103 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse21 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|))) (or (= (select |c_#valid| (select (let ((.cse20 (let ((.cse22 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base| (store .cse5 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_prepend_#t~mem8#1.base|)))) (store .cse22 .cse4 (store (select .cse22 .cse4) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse20 (select (select .cse20 .cse1) (+ .cse21 4)))) (+ v_arrayElimCell_103 4))) 1) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse6) (= |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| .cse21)))) (not (= .cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int)) (or (forall ((v_arrayElimCell_103 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse24 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|))) (let ((.cse23 (let ((.cse25 (let ((.cse26 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base| (store .cse5 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_prepend_#t~mem8#1.base|)))) (store .cse26 .cse4 (store (select .cse26 .cse4) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse25 (select (select .cse25 .cse1) (+ .cse24 4)))))) (or (= (select |c_#valid| (select .cse23 (+ v_arrayElimCell_103 4))) 1) (forall ((v_arrayElimCell_102 Int)) (= (select |c_#valid| (select .cse23 (+ v_arrayElimCell_102 4))) 1)) (= |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| .cse24))))) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse6))) (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int)) (or (forall ((v_arrayElimCell_103 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse27 (let ((.cse28 (let ((.cse29 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base| (store .cse5 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_prepend_#t~mem8#1.base|)))) (store .cse29 .cse4 (store (select .cse29 .cse4) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse28 (select (select .cse28 .cse1) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|) 4)))))) (or (= (select |c_#valid| (select .cse27 .cse14)) 1) (= (select |c_#valid| (select .cse27 (+ v_arrayElimCell_103 4))) 1)))) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse6)))))))) is different from true [2024-11-22 19:00:53,578 WARN L873 $PredicateComparison]: unable to prove that (or (not (= (select |c_#valid| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) 1)) (< |c_ULTIMATE.start_dll_prepend_~head#1.offset| 0) (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse30 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse30 |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|)) (.cse5 (select .cse30 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse0 (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse9 (+ .cse0 4)) (.cse14 (= .cse2 .cse5)) (.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)) (.cse22 (= .cse2 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))) (and (or (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int) (v_arrayElimCell_103 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|))) (or (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse0) (= (select |c_#valid| (select (let ((.cse1 (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base| (store .cse6 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) .cse5)))) (store .cse4 .cse5 (store (select .cse4 .cse5) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse1 (select (select .cse1 .cse2) (+ .cse3 4)))) (+ v_arrayElimCell_103 4))) 1) (= |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| .cse3)))) (not (= .cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int)) (or (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse0) (forall ((v_arrayElimCell_103 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse8 (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base| (store .cse6 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) .cse5)))) (store .cse11 .cse5 (store (select .cse11 .cse5) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse10 (select (select .cse10 .cse2) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|) 4)))))) (or (= (select |c_#valid| (select .cse8 (+ v_arrayElimCell_103 4))) 1) (= (select |c_#valid| (select .cse8 .cse9)) 1)))))) (or (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int) (v_arrayElimCell_103 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (or (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse0) (= (select |c_#valid| (select (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base| (store .cse6 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) .cse5)))) (store .cse13 .cse5 (store (select .cse13 .cse5) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse12 (select (select .cse12 .cse2) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|) 4)))) (+ v_arrayElimCell_103 4))) 1))) (not .cse14)) (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int)) (or (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse0) (forall ((v_arrayElimCell_103 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|))) (let ((.cse15 (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base| (store .cse6 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) .cse5)))) (store .cse18 .cse5 (store (select .cse18 .cse5) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse17 (select (select .cse17 .cse2) (+ .cse16 4)))))) (or (forall ((v_arrayElimCell_102 Int)) (= (select |c_#valid| (select .cse15 (+ v_arrayElimCell_102 4))) 1)) (= (select |c_#valid| (select .cse15 (+ v_arrayElimCell_103 4))) 1) (= |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| .cse16))))))) (or (and (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int)) (or (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse0) (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse20 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|))) (or (forall ((v_arrayElimCell_102 Int)) (= (select |c_#valid| (select (let ((.cse19 (let ((.cse21 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base| (store .cse6 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) .cse5)))) (store .cse21 .cse5 (store (select .cse21 .cse5) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse19 (select (select .cse19 .cse2) (+ .cse20 4)))) (+ v_arrayElimCell_102 4))) 1)) (= |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| .cse20)))))) (or .cse22 (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int) (v_arrayElimCell_102 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (or (= (select |c_#valid| (select (let ((.cse23 (let ((.cse24 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base| (store .cse6 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) .cse5)))) (store .cse24 .cse5 (store (select .cse24 .cse5) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse23 (select (select .cse23 .cse2) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|) 4)))) (+ v_arrayElimCell_102 4))) 1) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse0)))) (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int)) (or (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse0) (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (= (select |c_#valid| (select (let ((.cse25 (let ((.cse26 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base| (store .cse6 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) .cse5)))) (store .cse26 .cse5 (store (select .cse26 .cse5) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse25 (select (select .cse25 .cse2) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|) 4)))) .cse9)) 1))))) .cse14) (or (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int) (v_arrayElimCell_102 Int) (v_arrayElimCell_103 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse27 (let ((.cse28 (let ((.cse29 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base| (store .cse6 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) .cse5)))) (store .cse29 .cse5 (store (select .cse29 .cse5) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse28 (select (select .cse28 .cse2) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|) 4)))))) (or (= (select |c_#valid| (select .cse27 (+ v_arrayElimCell_102 4))) 1) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse0) (= (select |c_#valid| (select .cse27 (+ v_arrayElimCell_103 4))) 1)))) .cse22)))))) is different from true [2024-11-22 19:00:57,769 WARN L873 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_dll_prepend_~head#1.offset| 0) (let ((.cse30 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse6 (select .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse4 (select .cse30 |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 .cse30 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (= .cse4 .cse1)) (.cse20 (+ .cse6 4)) (.cse15 (= |c_ULTIMATE.start_node_create_#res#1.base| .cse1)) (.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_#res#1.base|))) (and (or (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int) (v_arrayElimCell_103 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (or (= (select |c_#valid| (select (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_#res#1.base| (store .cse5 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) .cse4)))) (store .cse3 .cse4 (store (select .cse3 .cse4) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_node_create_#res#1.base|))))) (select .cse0 (select (select .cse0 .cse1) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|) 4)))) (+ v_arrayElimCell_103 4))) 1) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse6))) (not .cse7)) (or (not (= .cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int) (v_arrayElimCell_103 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse9 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|))) (or (= (select |c_#valid| (select (let ((.cse8 (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_#res#1.base| (store .cse5 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) .cse4)))) (store .cse10 .cse4 (store (select .cse10 .cse4) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_node_create_#res#1.base|))))) (select .cse8 (select (select .cse8 .cse1) (+ .cse9 4)))) (+ v_arrayElimCell_103 4))) 1) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse6) (= |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| .cse9))))) (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int)) (or (forall ((v_arrayElimCell_103 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse12 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|))) (let ((.cse11 (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_#res#1.base| (store .cse5 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) .cse4)))) (store .cse14 .cse4 (store (select .cse14 .cse4) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_node_create_#res#1.base|))))) (select .cse13 (select (select .cse13 .cse1) (+ .cse12 4)))))) (or (= (select |c_#valid| (select .cse11 (+ v_arrayElimCell_103 4))) 1) (forall ((v_arrayElimCell_102 Int)) (= (select |c_#valid| (select .cse11 (+ v_arrayElimCell_102 4))) 1)) (= |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| .cse12))))) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse6))) (or .cse7 (and (or .cse15 (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int) (v_arrayElimCell_102 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (or (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse6) (= (select |c_#valid| (select (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_#res#1.base| (store .cse5 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) .cse4)))) (store .cse17 .cse4 (store (select .cse17 .cse4) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_node_create_#res#1.base|))))) (select .cse16 (select (select .cse16 .cse1) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|) 4)))) (+ v_arrayElimCell_102 4))) 1)))) (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int)) (or (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse6) (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (= (select |c_#valid| (select (let ((.cse18 (let ((.cse19 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_#res#1.base| (store .cse5 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) .cse4)))) (store .cse19 .cse4 (store (select .cse19 .cse4) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_node_create_#res#1.base|))))) (select .cse18 (select (select .cse18 .cse1) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|) 4)))) .cse20)) 1)))) (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int)) (or (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse22 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|))) (or (forall ((v_arrayElimCell_102 Int)) (= (select |c_#valid| (select (let ((.cse21 (let ((.cse23 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_#res#1.base| (store .cse5 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) .cse4)))) (store .cse23 .cse4 (store (select .cse23 .cse4) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_node_create_#res#1.base|))))) (select .cse21 (select (select .cse21 .cse1) (+ .cse22 4)))) (+ v_arrayElimCell_102 4))) 1)) (= |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| .cse22)))) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse6))))) (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int)) (or (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse6) (forall ((v_arrayElimCell_103 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse24 (let ((.cse25 (let ((.cse26 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_#res#1.base| (store .cse5 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) .cse4)))) (store .cse26 .cse4 (store (select .cse26 .cse4) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_node_create_#res#1.base|))))) (select .cse25 (select (select .cse25 .cse1) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|) 4)))))) (or (= (select |c_#valid| (select .cse24 (+ v_arrayElimCell_103 4))) 1) (= (select |c_#valid| (select .cse24 .cse20)) 1)))))) (or .cse15 (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int) (v_arrayElimCell_102 Int) (v_arrayElimCell_103 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse27 (let ((.cse28 (let ((.cse29 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_#res#1.base| (store .cse5 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) .cse4)))) (store .cse29 .cse4 (store (select .cse29 .cse4) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_node_create_#res#1.base|))))) (select .cse28 (select (select .cse28 .cse1) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|) 4)))))) (or (= (select |c_#valid| (select .cse27 (+ v_arrayElimCell_103 4))) 1) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse6) (= (select |c_#valid| (select .cse27 (+ v_arrayElimCell_102 4))) 1))))))))) (not (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1))) is different from true [2024-11-22 19:01:01,940 WARN L873 $PredicateComparison]: unable to prove that (or (not (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse30 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse6 (select .cse30 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse30 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse1 (+ .cse8 4)) (.cse24 (= .cse6 .cse3)) (.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (.cse21 (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse3))) (and (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int)) (or (forall ((v_arrayElimCell_103 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse0 (let ((.cse2 (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse7 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) .cse6)))) (store .cse5 .cse6 (store (select .cse5 .cse6) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (select .cse2 (select (select .cse2 .cse3) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|) 4)))))) (or (= (select |c_#valid| (select .cse0 (+ v_arrayElimCell_103 4))) 1) (= (select |c_#valid| (select .cse0 .cse1)) 1)))) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse8))) (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int)) (or (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse8) (forall ((v_arrayElimCell_103 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse10 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse7 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) .cse6)))) (store .cse12 .cse6 (store (select .cse12 .cse6) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (select .cse11 (select (select .cse11 .cse3) (+ .cse10 4)))))) (or (= (select |c_#valid| (select .cse9 (+ v_arrayElimCell_103 4))) 1) (forall ((v_arrayElimCell_102 Int)) (= (select |c_#valid| (select .cse9 (+ v_arrayElimCell_102 4))) 1)) (= |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| .cse10))))))) (or (not (= .cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int) (v_arrayElimCell_103 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse14 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|))) (or (= (select |c_#valid| (select (let ((.cse13 (let ((.cse15 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse7 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) .cse6)))) (store .cse15 .cse6 (store (select .cse15 .cse6) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (select .cse13 (select (select .cse13 .cse3) (+ .cse14 4)))) (+ v_arrayElimCell_103 4))) 1) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse8) (= |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| .cse14))))) (or (and (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int)) (or (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse17 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|))) (or (forall ((v_arrayElimCell_102 Int)) (= (select |c_#valid| (select (let ((.cse16 (let ((.cse18 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse7 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) .cse6)))) (store .cse18 .cse6 (store (select .cse18 .cse6) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (select .cse16 (select (select .cse16 .cse3) (+ .cse17 4)))) (+ v_arrayElimCell_102 4))) 1)) (= |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| .cse17)))) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse8))) (or (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int) (v_arrayElimCell_102 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (or (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse8) (= (select |c_#valid| (select (let ((.cse19 (let ((.cse20 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse7 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) .cse6)))) (store .cse20 .cse6 (store (select .cse20 .cse6) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (select .cse19 (select (select .cse19 .cse3) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|) 4)))) (+ v_arrayElimCell_102 4))) 1))) .cse21) (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int)) (or (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse8) (forall ((|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (= (select |c_#valid| (select (let ((.cse22 (let ((.cse23 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse7 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) .cse6)))) (store .cse23 .cse6 (store (select .cse23 .cse6) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (select .cse22 (select (select .cse22 .cse3) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|) 4)))) .cse1)) 1))))) .cse24) (or (not .cse24) (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int) (v_arrayElimCell_103 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (or (= (select |c_#valid| (select (let ((.cse25 (let ((.cse26 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse7 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) .cse6)))) (store .cse26 .cse6 (store (select .cse26 .cse6) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (select .cse25 (select (select .cse25 .cse3) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|) 4)))) (+ v_arrayElimCell_103 4))) 1) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse8)))) (or (forall ((|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int) (v_arrayElimCell_102 Int) (v_arrayElimCell_103 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse27 (let ((.cse28 (let ((.cse29 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse7 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4) .cse6)))) (store .cse29 .cse6 (store (select .cse29 .cse6) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (select .cse28 (select (select .cse28 .cse3) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |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|) 4)))))) (or (= (select |c_#valid| (select .cse27 (+ v_arrayElimCell_103 4))) 1) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| .cse8) (= (select |c_#valid| (select .cse27 (+ v_arrayElimCell_102 4))) 1)))) .cse21))))) (< |c_ULTIMATE.start_dll_prepend_~head#1.offset| 0)) is different from true [2024-11-22 19:01:01,991 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:01:01,991 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 125 treesize of output 102 [2024-11-22 19:01:02,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:01:02,023 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 251 treesize of output 191 [2024-11-22 19:01:02,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:01:02,052 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 255 treesize of output 195 [2024-11-22 19:01:02,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:01:02,083 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 106 [2024-11-22 19:01:02,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:01:02,103 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 102 [2024-11-22 19:01:02,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:01:02,135 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 102 [2024-11-22 19:01:02,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:01:02,156 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 251 treesize of output 191 [2024-11-22 19:01:02,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:01:02,187 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 125 treesize of output 102 [2024-11-22 19:01:19,873 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 1103 treesize of output 971 [2024-11-22 19:01:20,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:01:20,234 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 1760 treesize of output 1556 [2024-11-22 19:01:20,258 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 1338 treesize of output 1270 [2024-11-22 19:01:20,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:01:20,367 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 2328 treesize of output 2260 [2024-11-22 19:01:23,151 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:01:23,153 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:01:23,182 INFO L349 Elim1Store]: treesize reduction 66, result has 33.3 percent of original size [2024-11-22 19:01:23,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 99 treesize of output 105 [2024-11-22 19:01:23,592 INFO L349 Elim1Store]: treesize reduction 50, result has 33.3 percent of original size [2024-11-22 19:01:23,592 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 80 [2024-11-22 19:01:23,608 INFO L349 Elim1Store]: treesize reduction 20, result has 31.0 percent of original size [2024-11-22 19:01:23,608 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 60 treesize of output 52 [2024-11-22 19:01:27,923 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (.cse2 (store |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base| 1)) (.cse0 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse3 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) (.cse5 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 1))) (and (or .cse0 .cse1 (forall ((v_prenex_15 Int) (v_prenex_14 Int) (v_arrayElimArr_18 (Array Int Int))) (let ((.cse4 (+ v_prenex_15 4))) (or (< v_prenex_14 |c_ULTIMATE.start_dll_create_#res#1.offset|) (= (select .cse2 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_#res#1.base| v_arrayElimArr_18) (select v_arrayElimArr_18 .cse3)) .cse4)) 1) (= (select .cse2 (select v_arrayElimArr_18 .cse4)) 1) (not (= (select v_arrayElimArr_18 (+ v_prenex_14 8)) |c_ULTIMATE.start_dll_create_#res#1.base|)))))) (or .cse5 (forall ((v_arrayElimArr_10 (Array Int Int)) (v_prenex_18 Int) (v_prenex_17 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_19 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_10))) (let ((.cse7 (store (select .cse6 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ v_prenex_17 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (select (store .cse6 |c_ULTIMATE.start_dll_create_#res#1.base| .cse7) (select .cse7 .cse3)))) (+ v_prenex_18 4))) 1) (= |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_19) (< v_prenex_17 |c_ULTIMATE.start_dll_create_#res#1.offset|) (not (= (select v_arrayElimArr_10 (+ v_prenex_19 4)) |c_ULTIMATE.start_dll_create_#res#1.base|))))) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_13 (Array Int Int))) (let ((.cse8 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse9 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_13))) (or (= (select .cse8 (select (select .cse9 (select (select .cse9 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse3)) .cse3)) 1) (forall ((v_prenex_3 Int)) (let ((.cse10 (select v_arrayElimArr_13 (+ v_prenex_3 4)))) (or (not (= .cse10 |c_ULTIMATE.start_dll_create_#res#1.base|)) (= 1 (select .cse8 (select (select .cse9 .cse10) .cse3))))))))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_#res#1.base|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_prenex_3 Int)) (let ((.cse11 (select v_arrayElimArr_13 (+ v_prenex_3 4)))) (or (not (= .cse11 |c_ULTIMATE.start_dll_create_#res#1.base|)) (= 1 (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_13) .cse11) .cse3)))))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_#res#1.base|)))) .cse0) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int) (v_arrayElimCell_102 Int) (v_arrayElimCell_103 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse12 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse13 (let ((.cse14 (let ((.cse15 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11)) (.cse16 (select v_arrayElimArr_11 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)))) (store .cse15 .cse16 (store (select .cse15 .cse16) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse3))))) (or (= (select .cse12 (select .cse13 (+ v_arrayElimCell_103 4))) 1) (= (select .cse12 (select .cse13 (+ v_arrayElimCell_102 4))) 1)))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_#res#1.base|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_109 Int) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse22 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (let ((.cse23 (store (select .cse22 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ v_prenex_20 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse19 (+ v_prenex_22 4)) (.cse18 (store .cse22 |c_ULTIMATE.start_dll_create_#res#1.base| .cse23)) (.cse20 (+ v_prenex_21 4)) (.cse17 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse21 (select .cse23 .cse3))) (or (< v_prenex_20 v_arrayElimCell_109) (= (select .cse17 (select (select .cse18 (select (select .cse18 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse19)) .cse20)) 1) (not (= (select v_arrayElimArr_12 .cse19) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select .cse17 (select (select .cse18 .cse21) .cse20)) 1) (= (select .cse17 (select (select .cse22 .cse21) (+ v_arrayElimCell_109 4))) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_109 Int) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse29 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12)) (.cse31 (+ v_prenex_22 4))) (let ((.cse25 (let ((.cse32 (select v_arrayElimArr_12 .cse31))) (store .cse29 .cse32 (store (select .cse29 .cse32) (+ v_prenex_20 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse27 (+ v_prenex_21 4)) (.cse28 (select (select .cse25 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse3)) (.cse24 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse26 (select (select .cse25 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse31)) (.cse30 (+ v_arrayElimCell_109 4))) (or (= (select .cse24 (select (select .cse25 .cse26) .cse27)) 1) (< v_prenex_20 v_arrayElimCell_109) (= (select .cse24 (select (select .cse25 .cse28) .cse27)) 1) (= (select .cse24 (select (select .cse29 .cse28) .cse30)) 1) (= (select .cse24 (select (select .cse29 .cse26) .cse30)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_19 Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse33 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_10))) (let ((.cse34 (store (select .cse33 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ v_prenex_17 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (select (store .cse33 |c_ULTIMATE.start_dll_create_#res#1.base| .cse34) (select .cse34 .cse3)))) (+ v_prenex_18 4))) 1) (= |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_19) (not (= (select v_arrayElimArr_10 (+ v_prenex_19 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_109 Int) (v_arrayElimArr_13 (Array Int Int)) (v_prenex_3 Int)) (or (= (select v_arrayElimArr_13 (+ v_prenex_3 4)) |c_ULTIMATE.start_dll_create_#res#1.base|) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse35 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_13))) (select .cse35 (select (select .cse35 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse3))) (+ v_arrayElimCell_109 4))) 1))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_16 Int) (v_prenex_15 Int) (v_arrayElimArr_17 (Array Int Int)) (v_prenex_14 Int)) (let ((.cse41 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_17))) (let ((.cse38 (store (select .cse41 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ v_prenex_14 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse36 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse37 (store .cse41 |c_ULTIMATE.start_dll_create_#res#1.base| .cse38)) (.cse40 (+ v_prenex_16 4)) (.cse39 (+ v_prenex_15 4))) (or (= (select .cse36 (select (select .cse37 (select .cse38 .cse3)) .cse39)) 1) (not (= (select v_arrayElimArr_17 .cse40) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select .cse36 (select (select .cse37 (select (select .cse37 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse40)) .cse39)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_109 Int) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse45 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (let ((.cse43 (let ((.cse46 (select v_arrayElimArr_12 (+ v_prenex_22 4)))) (store .cse45 .cse46 (store (select .cse45 .cse46) (+ v_prenex_20 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse42 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse44 (select (select .cse43 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse3))) (or (< v_prenex_20 v_arrayElimCell_109) (= (select .cse42 (select (select .cse43 .cse44) (+ v_prenex_21 4))) 1) (= (select .cse42 (select (select .cse45 .cse44) (+ v_arrayElimCell_109 4))) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_109 Int) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse52 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12)) (.cse49 (+ v_prenex_22 4))) (let ((.cse48 (let ((.cse53 (select v_arrayElimArr_12 .cse49))) (store .cse52 .cse53 (store (select .cse52 .cse53) (+ v_prenex_20 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse50 (+ v_prenex_21 4)) (.cse47 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse51 (select (select .cse48 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse3))) (or (= (select .cse47 (select (select .cse48 (select (select .cse48 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse49)) .cse50)) 1) (< v_prenex_20 v_arrayElimCell_109) (= (select .cse47 (select (select .cse48 .cse51) .cse50)) 1) (= (select .cse47 (select (select .cse52 .cse51) (+ v_arrayElimCell_109 4))) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_109 Int) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse55 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (let ((.cse56 (store (select .cse55 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ v_prenex_20 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse54 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse57 (select .cse56 .cse3))) (or (< v_prenex_20 v_arrayElimCell_109) (not (= (select v_arrayElimArr_12 (+ v_prenex_22 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select .cse54 (select (select (store .cse55 |c_ULTIMATE.start_dll_create_#res#1.base| .cse56) .cse57) (+ v_prenex_21 4))) 1) (= (select .cse54 (select (select .cse55 .cse57) (+ v_arrayElimCell_109 4))) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_12 Int) (v_arrayElimArr_14 (Array Int Int)) (v_prenex_11 Int) (v_prenex_13 Int)) (let ((.cse58 (select v_arrayElimArr_14 (+ v_prenex_13 4)))) (or (= .cse58 |c_ULTIMATE.start_dll_create_#res#1.base|) (= |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_13) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse59 (let ((.cse60 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_14))) (store .cse60 .cse58 (store (select .cse60 .cse58) (+ v_prenex_11 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse59 (select (select .cse59 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse3))) (+ v_prenex_12 4))) 1)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_16 Int) (v_prenex_15 Int) (v_arrayElimArr_17 (Array Int Int)) (v_prenex_14 Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse61 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_17))) (let ((.cse62 (store (select .cse61 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ v_prenex_14 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (select (store .cse61 |c_ULTIMATE.start_dll_create_#res#1.base| .cse62) (select .cse62 .cse3)))) (+ v_prenex_15 4))) 1) (not (= (select v_arrayElimArr_17 (+ v_prenex_16 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse63 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse64 (let ((.cse65 (let ((.cse66 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse67 (select v_arrayElimArr_16 (+ v_prenex_10 4)))) (store .cse66 .cse67 (store (select .cse66 .cse67) (+ 8 v_prenex_7) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse65 (select (select .cse65 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse3))))) (or (= |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_10) (= (select .cse63 (select .cse64 (+ v_prenex_9 4))) 1) (= (select .cse63 (select .cse64 (+ v_prenex_8 4))) 1)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_109 Int) (v_prenex_20 Int)) (or (< v_prenex_20 v_arrayElimCell_109) (forall ((v_arrayElimArr_12 (Array Int Int))) (let ((.cse73 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (let ((.cse76 (store (select .cse73 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ v_prenex_20 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse68 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse75 (select .cse76 .cse3)) (.cse74 (+ v_arrayElimCell_109 4))) (or (forall ((v_prenex_21 Int)) (let ((.cse69 (store .cse73 |c_ULTIMATE.start_dll_create_#res#1.base| .cse76)) (.cse71 (+ v_prenex_21 4))) (or (forall ((v_prenex_22 Int)) (let ((.cse72 (+ v_prenex_22 4))) (let ((.cse70 (select (select .cse69 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse72))) (or (= (select .cse68 (select (select .cse69 .cse70) .cse71)) 1) (not (= (select v_arrayElimArr_12 .cse72) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select .cse68 (select (select .cse73 .cse70) .cse74)) 1))))) (= (select .cse68 (select (select .cse69 .cse75) .cse71)) 1)))) (= (select .cse68 (select (select .cse73 .cse75) .cse74)) 1)))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_#res#1.base|) (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int) (v_arrayElimCell_102 Int) (v_arrayElimCell_103 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse77 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse78 (let ((.cse79 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11))) (let ((.cse80 (store (select .cse79 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (select (store .cse79 |c_ULTIMATE.start_dll_create_#res#1.base| .cse80) (select .cse80 .cse3)))))) (or (not (= (select v_arrayElimArr_11 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select .cse77 (select .cse78 (+ v_arrayElimCell_102 4))) 1) (= (select .cse77 (select .cse78 (+ v_arrayElimCell_103 4))) 1)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimCell_109 Int) (v_arrayElimArr_13 (Array Int Int)) (v_prenex_3 Int)) (let ((.cse81 (select v_arrayElimArr_13 (+ v_prenex_3 4))) (.cse82 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse83 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_13)) (.cse84 (+ v_arrayElimCell_109 4))) (or (= .cse81 |c_ULTIMATE.start_dll_create_#res#1.base|) (= (select .cse82 (select (select .cse83 .cse81) .cse84)) 1) (= (select .cse82 (select (select .cse83 (select (select .cse83 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse3)) .cse84)) 1)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimArr_15 (Array Int Int))) (let ((.cse85 (select v_arrayElimArr_15 (+ v_prenex_6 4)))) (or (= .cse85 |c_ULTIMATE.start_dll_create_#res#1.base|) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse86 (let ((.cse87 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_15))) (store .cse87 .cse85 (store (select .cse87 .cse85) (+ 8 v_prenex_4) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse86 (select (select .cse86 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse3))) (+ v_prenex_5 4))) 1)))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_#res#1.base|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse88 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse89 (let ((.cse90 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse91 (store (select .cse90 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ 8 v_prenex_7) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (select (store .cse90 |c_ULTIMATE.start_dll_create_#res#1.base| .cse91) (select .cse91 .cse3)))))) (or (= |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_10) (not (= (select v_arrayElimArr_16 (+ v_prenex_10 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select .cse88 (select .cse89 (+ v_prenex_9 4))) 1) (= (select .cse88 (select .cse89 (+ v_prenex_8 4))) 1))))))) .cse5) (or (forall ((v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse93 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (let ((.cse95 (store (select .cse93 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ v_prenex_20 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse92 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse94 (select .cse95 .cse3))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (< v_prenex_20 |c_ULTIMATE.start_dll_create_#res#1.offset|) (= (select .cse92 (select (select .cse93 .cse94) .cse3)) 1) (not (= (select v_arrayElimArr_12 (+ v_prenex_22 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select .cse92 (select (select (store .cse93 |c_ULTIMATE.start_dll_create_#res#1.base| .cse95) .cse94) (+ v_prenex_21 4))) 1)))))) .cse5) (or .cse0 (forall ((v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse97 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (let ((.cse103 (store (select .cse97 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ v_prenex_20 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse99 (store .cse97 |c_ULTIMATE.start_dll_create_#res#1.base| .cse103)) (.cse102 (+ v_prenex_22 4))) (let ((.cse98 (select (select .cse99 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse102)) (.cse96 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse101 (select .cse103 .cse3)) (.cse100 (+ v_prenex_21 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (< v_prenex_20 |c_ULTIMATE.start_dll_create_#res#1.offset|) (= (select .cse96 (select (select .cse97 .cse98) .cse3)) 1) (= (select .cse96 (select (select .cse99 .cse98) .cse100)) 1) (= (select .cse96 (select (select .cse97 .cse101) .cse3)) 1) (not (= (select v_arrayElimArr_12 .cse102) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select .cse96 (select (select .cse99 .cse101) .cse100)) 1)))))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_20 Int)) (or (< v_prenex_20 |c_ULTIMATE.start_dll_create_#res#1.offset|) (forall ((v_arrayElimArr_12 (Array Int Int)) (v_prenex_21 Int)) (let ((.cse108 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (let ((.cse106 (store (select .cse108 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ v_prenex_20 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse104 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse107 (+ v_prenex_21 4)) (.cse105 (store .cse108 |c_ULTIMATE.start_dll_create_#res#1.base| .cse106))) (or (= (select .cse104 (select (select .cse105 (select .cse106 .cse3)) .cse107)) 1) (forall ((v_prenex_22 Int)) (let ((.cse110 (+ v_prenex_22 4))) (let ((.cse109 (select (select .cse105 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse110))) (or (= (select .cse104 (select (select .cse108 .cse109) .cse3)) 1) (= (select .cse104 (select (select .cse105 .cse109) .cse107)) 1) (not (= (select v_arrayElimArr_12 .cse110) |c_ULTIMATE.start_dll_create_#res#1.base|))))))))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_20 Int)) (or (< v_prenex_20 |c_ULTIMATE.start_dll_create_#res#1.offset|) (forall ((v_arrayElimArr_12 (Array Int Int)) (v_prenex_22 Int) (v_prenex_21 Int)) (let ((.cse112 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (let ((.cse114 (store .cse112 |c_ULTIMATE.start_dll_create_#res#1.base| (store (select .cse112 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ v_prenex_20 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse115 (+ v_prenex_22 4))) (let ((.cse111 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse113 (select (select .cse114 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse115))) (or (= (select .cse111 (select (select .cse112 .cse113) .cse3)) 1) (= (select .cse111 (select (select .cse114 .cse113) (+ v_prenex_21 4))) 1) (not (= (select v_arrayElimArr_12 .cse115) |c_ULTIMATE.start_dll_create_#res#1.base|))))))))))))) (or .cse5 (forall ((v_prenex_16 Int) (v_prenex_15 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_arrayElimArr_17 (Array Int Int)) (v_prenex_14 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse116 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_17))) (let ((.cse117 (store (select .cse116 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ v_prenex_14 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (select (store .cse116 |c_ULTIMATE.start_dll_create_#res#1.base| .cse117) (select .cse117 .cse3)))) (+ v_prenex_15 4))) 1) (not (= (select v_arrayElimArr_17 (+ v_prenex_16 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)) (< v_prenex_14 |c_ULTIMATE.start_dll_create_#res#1.offset|)))) (or .cse0 .cse1 (forall ((v_arrayElimCell_117 Int)) (= (select .cse2 v_arrayElimCell_117) 1))) (or (forall ((v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse119 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (let ((.cse122 (store (select .cse119 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ v_prenex_20 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse121 (store .cse119 |c_ULTIMATE.start_dll_create_#res#1.base| .cse122)) (.cse123 (+ v_prenex_22 4))) (let ((.cse120 (select (select .cse121 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse123)) (.cse118 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (< v_prenex_20 |c_ULTIMATE.start_dll_create_#res#1.offset|) (= (select .cse118 (select (select .cse119 .cse120) .cse3)) 1) (= (select .cse118 (select (select .cse121 .cse120) (+ v_prenex_21 4))) 1) (= (select .cse118 (select (select .cse119 (select .cse122 .cse3)) .cse3)) 1) (not (= (select v_arrayElimArr_12 .cse123) |c_ULTIMATE.start_dll_create_#res#1.base|)))))))) .cse0) (or (forall ((v_prenex_16 Int) (v_prenex_15 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_arrayElimArr_17 (Array Int Int)) (v_prenex_14 Int)) (let ((.cse129 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_17))) (let ((.cse126 (store (select .cse129 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ v_prenex_14 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse124 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse125 (store .cse129 |c_ULTIMATE.start_dll_create_#res#1.base| .cse126)) (.cse128 (+ v_prenex_16 4)) (.cse127 (+ v_prenex_15 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= (select .cse124 (select (select .cse125 (select .cse126 .cse3)) .cse127)) 1) (not (= (select v_arrayElimArr_17 .cse128) |c_ULTIMATE.start_dll_create_#res#1.base|)) (< v_prenex_14 |c_ULTIMATE.start_dll_create_#res#1.offset|) (= (select .cse124 (select (select .cse125 (select (select .cse125 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse128)) .cse127)) 1)))))) .cse5) (or (forall ((v_prenex_7 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse130 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse131 (let ((.cse132 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse133 (store (select .cse132 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ 8 v_prenex_7) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (select (store .cse132 |c_ULTIMATE.start_dll_create_#res#1.base| .cse133) (select .cse133 .cse3)))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (< v_prenex_7 |c_ULTIMATE.start_dll_create_#res#1.offset|) (= |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_10) (not (= (select v_arrayElimArr_16 (+ v_prenex_10 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select .cse130 (select .cse131 (+ v_prenex_9 4))) 1) (= (select .cse130 (select .cse131 (+ v_prenex_8 4))) 1)))) .cse5) (or (forall ((v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse138 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (let ((.cse140 (store (select .cse138 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ v_prenex_20 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse136 (+ v_prenex_22 4)) (.cse134 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse135 (store .cse138 |c_ULTIMATE.start_dll_create_#res#1.base| .cse140)) (.cse139 (select .cse140 .cse3)) (.cse137 (+ v_prenex_21 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (< v_prenex_20 |c_ULTIMATE.start_dll_create_#res#1.offset|) (= (select .cse134 (select (select .cse135 (select (select .cse135 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse136)) .cse137)) 1) (= (select .cse134 (select (select .cse138 .cse139) .cse3)) 1) (not (= (select v_arrayElimArr_12 .cse136) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select .cse134 (select (select .cse135 .cse139) .cse137)) 1)))))) .cse5) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_12 (Array Int Int)) (v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse144 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (let ((.cse142 (let ((.cse145 (select v_arrayElimArr_12 (+ v_prenex_22 4)))) (store .cse144 .cse145 (store (select .cse144 .cse145) (+ v_prenex_20 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse141 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse143 (select (select .cse142 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse3))) (or (< v_prenex_20 |c_ULTIMATE.start_dll_create_#res#1.offset|) (= (select .cse141 (select (select .cse142 .cse143) (+ v_prenex_21 4))) 1) (= (select .cse141 (select (select .cse144 .cse143) .cse3)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_prenex_3 Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse146 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_13))) (select .cse146 (select (select .cse146 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse3))) .cse3)) 1) (= (select v_arrayElimArr_13 (+ v_prenex_3 4)) |c_ULTIMATE.start_dll_create_#res#1.base|))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse147 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse148 (let ((.cse149 (let ((.cse150 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse151 (select v_arrayElimArr_16 (+ v_prenex_10 4)))) (store .cse150 .cse151 (store (select .cse150 .cse151) (+ 8 v_prenex_7) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse149 (select (select .cse149 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse3))))) (or (< v_prenex_7 |c_ULTIMATE.start_dll_create_#res#1.offset|) (= |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_10) (= (select .cse147 (select .cse148 (+ v_prenex_9 4))) 1) (= (select .cse147 (select .cse148 (+ v_prenex_8 4))) 1)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_#res#1.base|) (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimArr_15 (Array Int Int))) (let ((.cse152 (select v_arrayElimArr_15 (+ v_prenex_6 4)))) (or (= .cse152 |c_ULTIMATE.start_dll_create_#res#1.base|) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse153 (let ((.cse154 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_15))) (store .cse154 .cse152 (store (select .cse154 .cse152) (+ 8 v_prenex_4) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse153 (select (select .cse153 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse3))) (+ v_prenex_5 4))) 1) (< v_prenex_4 |c_ULTIMATE.start_dll_create_#res#1.offset|)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_12 (Array Int Int)) (v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse160 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12)) (.cse157 (+ v_prenex_22 4))) (let ((.cse156 (let ((.cse161 (select v_arrayElimArr_12 .cse157))) (store .cse160 .cse161 (store (select .cse160 .cse161) (+ v_prenex_20 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse158 (+ v_prenex_21 4)) (.cse155 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse159 (select (select .cse156 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse3))) (or (< v_prenex_20 |c_ULTIMATE.start_dll_create_#res#1.offset|) (= (select .cse155 (select (select .cse156 (select (select .cse156 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse157)) .cse158)) 1) (= (select .cse155 (select (select .cse156 .cse159) .cse158)) 1) (= (select .cse155 (select (select .cse160 .cse159) .cse3)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_19 Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse162 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_10))) (let ((.cse163 (store (select .cse162 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ v_prenex_17 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (select (store .cse162 |c_ULTIMATE.start_dll_create_#res#1.base| .cse163) (select .cse163 .cse3)))) (+ v_prenex_18 4))) 1) (= |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_19) (< v_prenex_17 |c_ULTIMATE.start_dll_create_#res#1.offset|) (not (= (select v_arrayElimArr_10 (+ v_prenex_19 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_16 Int) (v_prenex_15 Int) (v_arrayElimArr_17 (Array Int Int)) (v_prenex_14 Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse164 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_17))) (let ((.cse165 (store (select .cse164 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ v_prenex_14 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (select (store .cse164 |c_ULTIMATE.start_dll_create_#res#1.base| .cse165) (select .cse165 .cse3)))) (+ v_prenex_15 4))) 1) (not (= (select v_arrayElimArr_17 (+ v_prenex_16 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)) (< v_prenex_14 |c_ULTIMATE.start_dll_create_#res#1.offset|))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_14 Int)) (or (< v_prenex_14 |c_ULTIMATE.start_dll_create_#res#1.offset|) (forall ((v_prenex_16 Int) (v_arrayElimArr_17 (Array Int Int))) (let ((.cse170 (+ v_prenex_16 4))) (or (forall ((v_prenex_15 Int)) (let ((.cse171 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_17))) (let ((.cse168 (store (select .cse171 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ v_prenex_14 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse166 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse167 (store .cse171 |c_ULTIMATE.start_dll_create_#res#1.base| .cse168)) (.cse169 (+ v_prenex_15 4))) (or (= (select .cse166 (select (select .cse167 (select .cse168 .cse3)) .cse169)) 1) (= (select .cse166 (select (select .cse167 (select (select .cse167 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse170)) .cse169)) 1)))))) (not (= (select v_arrayElimArr_17 .cse170) |c_ULTIMATE.start_dll_create_#res#1.base|))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int) (v_arrayElimCell_102 Int) (v_arrayElimCell_103 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse172 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse173 (let ((.cse174 (let ((.cse175 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11)) (.cse176 (select v_arrayElimArr_11 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)))) (store .cse175 .cse176 (store (select .cse175 .cse176) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse174 (select (select .cse174 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse3))))) (or (= (select .cse172 (select .cse173 (+ v_arrayElimCell_103 4))) 1) (= (select .cse172 (select .cse173 (+ v_arrayElimCell_102 4))) 1) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| |c_ULTIMATE.start_dll_create_#res#1.offset|)))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_#res#1.base|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_12 (Array Int Int)) (v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse182 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12)) (.cse183 (+ v_prenex_22 4))) (let ((.cse178 (let ((.cse184 (select v_arrayElimArr_12 .cse183))) (store .cse182 .cse184 (store (select .cse182 .cse184) (+ v_prenex_20 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse180 (+ v_prenex_21 4)) (.cse181 (select (select .cse178 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse3)) (.cse177 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse179 (select (select .cse178 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse183))) (or (< v_prenex_20 |c_ULTIMATE.start_dll_create_#res#1.offset|) (= (select .cse177 (select (select .cse178 .cse179) .cse180)) 1) (= (select .cse177 (select (select .cse178 .cse181) .cse180)) 1) (= (select .cse177 (select (select .cse182 .cse181) .cse3)) 1) (= (select .cse177 (select (select .cse182 .cse179) .cse3)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_12 Int) (v_arrayElimArr_14 (Array Int Int)) (v_prenex_11 Int) (v_prenex_13 Int)) (let ((.cse185 (select v_arrayElimArr_14 (+ v_prenex_13 4)))) (or (= .cse185 |c_ULTIMATE.start_dll_create_#res#1.base|) (= |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_13) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse186 (let ((.cse187 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_14))) (store .cse187 .cse185 (store (select .cse187 .cse185) (+ v_prenex_11 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse186 (select (select .cse186 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse3))) (+ v_prenex_12 4))) 1) (< v_prenex_11 |c_ULTIMATE.start_dll_create_#res#1.offset|)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_prenex_3 Int)) (let ((.cse188 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse189 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_13)) (.cse190 (select v_arrayElimArr_13 (+ v_prenex_3 4)))) (or (= (select .cse188 (select (select .cse189 (select (select .cse189 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse3)) .cse3)) 1) (= .cse190 |c_ULTIMATE.start_dll_create_#res#1.base|) (= 1 (select .cse188 (select (select .cse189 .cse190) .cse3))))))))) .cse5) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int) (v_arrayElimCell_102 Int) (v_arrayElimCell_103 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse191 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse192 (let ((.cse193 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11))) (let ((.cse194 (store (select .cse193 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (select (store .cse193 |c_ULTIMATE.start_dll_create_#res#1.base| .cse194) (select .cse194 .cse3)))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (not (= (select v_arrayElimArr_11 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select .cse191 (select .cse192 (+ v_arrayElimCell_102 4))) 1) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_#res#1.base|) (= (select .cse191 (select .cse192 (+ v_arrayElimCell_103 4))) 1) (< |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| |c_ULTIMATE.start_dll_create_#res#1.offset|)))) .cse5))) is different from true