./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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_update_all.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 c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 07:01:09,568 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 07:01:09,607 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 07:01:09,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 07:01:09,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 07:01:09,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 07:01:09,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 07:01:09,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 07:01:09,627 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 07:01:09,627 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 07:01:09,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 07:01:09,627 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 07:01:09,628 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 07:01:09,628 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 07:01:09,629 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 07:01:09,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 07:01:09,630 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 07:01:09,632 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 07:01:09,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 07:01:09,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 07:01:09,633 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 07:01:09,633 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 07:01:09,634 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 07:01:09,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 07:01:09,634 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 07:01:09,634 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 07:01:09,635 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 07:01:09,635 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 07:01:09,635 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 07:01:09,635 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 07:01:09,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 07:01:09,635 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 07:01:09,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 07:01:09,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 07:01:09,636 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 07:01:09,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 07:01:09,636 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 07:01:09,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 07:01:09,636 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 07:01:09,636 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 07:01:09,637 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 07:01:09,637 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 07:01:09,638 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 -> c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 [2024-11-19 07:01:09,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 07:01:09,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 07:01:09,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 07:01:09,897 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 07:01:09,897 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 07:01:09,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_update_all.i [2024-11-19 07:01:11,214 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 07:01:11,411 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 07:01:11,412 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all.i [2024-11-19 07:01:11,425 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d75c655b7/a13e9a94e5954bf4bebbadba8cb6b4d5/FLAG14763ec6a [2024-11-19 07:01:11,782 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d75c655b7/a13e9a94e5954bf4bebbadba8cb6b4d5 [2024-11-19 07:01:11,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 07:01:11,785 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 07:01:11,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 07:01:11,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 07:01:11,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 07:01:11,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:01:11" (1/1) ... [2024-11-19 07:01:11,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59469c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:11, skipping insertion in model container [2024-11-19 07:01:11,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:01:11" (1/1) ... [2024-11-19 07:01:11,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 07:01:12,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 07:01:12,083 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 07:01:12,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 07:01:12,139 INFO L204 MainTranslator]: Completed translation [2024-11-19 07:01:12,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:12 WrapperNode [2024-11-19 07:01:12,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 07:01:12,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 07:01:12,140 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 07:01:12,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 07:01:12,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:12" (1/1) ... [2024-11-19 07:01:12,159 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:12" (1/1) ... [2024-11-19 07:01:12,203 INFO L138 Inliner]: procedures = 126, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 120 [2024-11-19 07:01:12,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 07:01:12,210 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 07:01:12,210 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 07:01:12,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 07:01:12,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:12" (1/1) ... [2024-11-19 07:01:12,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:12" (1/1) ... [2024-11-19 07:01:12,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:12" (1/1) ... [2024-11-19 07:01:12,264 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-19 07:01:12,265 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:12" (1/1) ... [2024-11-19 07:01:12,265 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:12" (1/1) ... [2024-11-19 07:01:12,271 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:12" (1/1) ... [2024-11-19 07:01:12,274 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:12" (1/1) ... [2024-11-19 07:01:12,275 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:12" (1/1) ... [2024-11-19 07:01:12,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:12" (1/1) ... [2024-11-19 07:01:12,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 07:01:12,282 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 07:01:12,282 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 07:01:12,282 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 07:01:12,284 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:12" (1/1) ... [2024-11-19 07:01:12,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 07:01:12,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:01:12,330 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-19 07:01:12,335 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-19 07:01:12,375 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-19 07:01:12,375 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-19 07:01:12,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 07:01:12,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 07:01:12,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 07:01:12,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 07:01:12,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 07:01:12,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 07:01:12,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 07:01:12,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 07:01:12,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 07:01:12,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 07:01:12,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 07:01:12,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 07:01:12,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 07:01:12,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 07:01:12,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 07:01:12,476 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 07:01:12,478 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 07:01:12,499 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-19 07:01:12,722 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-19 07:01:12,723 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 07:01:12,738 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 07:01:12,739 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-19 07:01:12,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:01:12 BoogieIcfgContainer [2024-11-19 07:01:12,739 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 07:01:12,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 07:01:12,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 07:01:12,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 07:01:12,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:01:11" (1/3) ... [2024-11-19 07:01:12,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bfbbd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:01:12, skipping insertion in model container [2024-11-19 07:01:12,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:01:12" (2/3) ... [2024-11-19 07:01:12,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bfbbd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:01:12, skipping insertion in model container [2024-11-19 07:01:12,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:01:12" (3/3) ... [2024-11-19 07:01:12,751 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2024-11-19 07:01:12,765 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 07:01:12,766 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-11-19 07:01:12,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 07:01:12,825 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;@2576582a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 07:01:12,826 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-11-19 07:01:12,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 68 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:12,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 07:01:12,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:12,837 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 07:01:12,837 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:12,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:12,843 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2024-11-19 07:01:12,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:12,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585063332] [2024-11-19 07:01:12,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:12,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:13,067 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-19 07:01:13,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:13,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585063332] [2024-11-19 07:01:13,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585063332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:01:13,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:01:13,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:01:13,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009456954] [2024-11-19 07:01:13,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:01:13,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:01:13,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:13,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:01:13,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:01:13,106 INFO L87 Difference]: Start difference. First operand has 70 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 68 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-19 07:01:13,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:13,179 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2024-11-19 07:01:13,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:01:13,182 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-19 07:01:13,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:13,187 INFO L225 Difference]: With dead ends: 66 [2024-11-19 07:01:13,188 INFO L226 Difference]: Without dead ends: 61 [2024-11-19 07:01:13,190 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-19 07:01:13,193 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 9 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:13,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 102 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:01:13,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-19 07:01:13,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-19 07:01:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 60 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2024-11-19 07:01:13,220 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 5 [2024-11-19 07:01:13,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:13,220 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2024-11-19 07:01:13,221 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-19 07:01:13,221 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2024-11-19 07:01:13,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 07:01:13,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:13,221 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 07:01:13,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 07:01:13,221 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:13,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:13,222 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2024-11-19 07:01:13,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:13,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912875684] [2024-11-19 07:01:13,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:13,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:13,331 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-19 07:01:13,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:13,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912875684] [2024-11-19 07:01:13,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912875684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:01:13,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:01:13,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:01:13,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912999315] [2024-11-19 07:01:13,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:01:13,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:01:13,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:13,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:01:13,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:01:13,334 INFO L87 Difference]: Start difference. First operand 61 states and 67 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-19 07:01:13,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:13,376 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2024-11-19 07:01:13,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:01:13,376 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-19 07:01:13,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:13,377 INFO L225 Difference]: With dead ends: 58 [2024-11-19 07:01:13,377 INFO L226 Difference]: Without dead ends: 58 [2024-11-19 07:01:13,377 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-19 07:01:13,378 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 8 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:13,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 97 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:01:13,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-19 07:01:13,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-19 07:01:13,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 57 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:13,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2024-11-19 07:01:13,384 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 5 [2024-11-19 07:01:13,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:13,384 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2024-11-19 07:01:13,384 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-19 07:01:13,384 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2024-11-19 07:01:13,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 07:01:13,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:13,385 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:13,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 07:01:13,386 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:13,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:13,388 INFO L85 PathProgramCache]: Analyzing trace with hash 678997037, now seen corresponding path program 1 times [2024-11-19 07:01:13,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:13,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329541154] [2024-11-19 07:01:13,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:13,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:13,436 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-19 07:01:13,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:13,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329541154] [2024-11-19 07:01:13,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329541154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:01:13,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:01:13,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:01:13,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936952410] [2024-11-19 07:01:13,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:01:13,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:01:13,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:13,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:01:13,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:01:13,439 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:13,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:13,457 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2024-11-19 07:01:13,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:01:13,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-11-19 07:01:13,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:13,458 INFO L225 Difference]: With dead ends: 68 [2024-11-19 07:01:13,458 INFO L226 Difference]: Without dead ends: 68 [2024-11-19 07:01:13,459 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-19 07:01:13,464 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 10 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 121 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-19 07:01:13,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 121 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:01:13,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-19 07:01:13,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2024-11-19 07:01:13,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:13,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2024-11-19 07:01:13,469 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 8 [2024-11-19 07:01:13,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:13,469 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-11-19 07:01:13,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:13,469 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2024-11-19 07:01:13,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 07:01:13,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:13,470 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:13,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 07:01:13,470 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:13,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:13,471 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2024-11-19 07:01:13,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:13,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599796015] [2024-11-19 07:01:13,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:13,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:13,519 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-19 07:01:13,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:13,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599796015] [2024-11-19 07:01:13,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599796015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:01:13,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:01:13,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:01:13,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888738533] [2024-11-19 07:01:13,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:01:13,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:01:13,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:13,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:01:13,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:01:13,521 INFO L87 Difference]: Start difference. First operand 59 states and 65 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-19 07:01:13,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:13,541 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2024-11-19 07:01:13,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:01:13,542 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-19 07:01:13,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:13,543 INFO L225 Difference]: With dead ends: 64 [2024-11-19 07:01:13,543 INFO L226 Difference]: Without dead ends: 64 [2024-11-19 07:01:13,543 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-19 07:01:13,544 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 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-19 07:01:13,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:01:13,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-19 07:01:13,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-19 07:01:13,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:13,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2024-11-19 07:01:13,555 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 9 [2024-11-19 07:01:13,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:13,555 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2024-11-19 07:01:13,555 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-19 07:01:13,556 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2024-11-19 07:01:13,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 07:01:13,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:13,556 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:13,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 07:01:13,557 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:13,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:13,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2114731710, now seen corresponding path program 1 times [2024-11-19 07:01:13,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:13,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937341509] [2024-11-19 07:01:13,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:13,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:13,690 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-19 07:01:13,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:13,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937341509] [2024-11-19 07:01:13,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937341509] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:01:13,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270958077] [2024-11-19 07:01:13,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:13,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:13,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:01:13,693 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-19 07:01:13,695 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-19 07:01:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:13,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 07:01:13,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:01:13,848 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-19 07:01:13,850 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:01:13,881 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-19 07:01:13,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270958077] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:01:13,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:01:13,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-19 07:01:13,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470876830] [2024-11-19 07:01:13,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:01:13,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 07:01:13,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:13,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 07:01:13,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:01:13,883 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:13,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:13,898 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2024-11-19 07:01:13,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 07:01:13,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-19 07:01:13,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:13,899 INFO L225 Difference]: With dead ends: 66 [2024-11-19 07:01:13,899 INFO L226 Difference]: Without dead ends: 66 [2024-11-19 07:01:13,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:01:13,900 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 10 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 130 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-19 07:01:13,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 130 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:01:13,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-19 07:01:13,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-19 07:01:13,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.469387755102041) internal successors, (72), 65 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-19 07:01:13,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2024-11-19 07:01:13,908 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 15 [2024-11-19 07:01:13,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:13,908 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2024-11-19 07:01:13,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:13,908 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2024-11-19 07:01:13,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 07:01:13,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:13,908 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:13,921 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-19 07:01:14,109 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-19 07:01:14,110 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:14,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:14,110 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2024-11-19 07:01:14,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:14,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164307012] [2024-11-19 07:01:14,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:14,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:14,288 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-19 07:01:14,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:14,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164307012] [2024-11-19 07:01:14,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164307012] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:01:14,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463492230] [2024-11-19 07:01:14,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:14,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:14,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:01:14,293 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-19 07:01:14,294 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-19 07:01:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:14,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 07:01:14,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:01:14,403 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-19 07:01:14,441 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 07:01:14,441 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-19 07:01:14,465 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-19 07:01:14,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:01:14,507 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-19 07:01:14,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463492230] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:01:14,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:01:14,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-19 07:01:14,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460453427] [2024-11-19 07:01:14,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:01:14,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 07:01:14,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:14,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 07:01:14,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:01:14,510 INFO L87 Difference]: Start difference. First operand 66 states and 72 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-19 07:01:14,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:14,583 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2024-11-19 07:01:14,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 07:01:14,584 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-19 07:01:14,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:14,584 INFO L225 Difference]: With dead ends: 65 [2024-11-19 07:01:14,584 INFO L226 Difference]: Without dead ends: 65 [2024-11-19 07:01:14,584 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-19 07:01:14,585 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 4 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:14,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 160 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:01:14,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-19 07:01:14,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-19 07:01:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 64 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-19 07:01:14,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2024-11-19 07:01:14,588 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 16 [2024-11-19 07:01:14,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:14,589 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2024-11-19 07:01:14,589 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-19 07:01:14,589 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2024-11-19 07:01:14,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 07:01:14,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:14,589 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:14,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 07:01:14,790 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-19 07:01:14,790 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:14,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:14,791 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2024-11-19 07:01:14,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:14,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367042259] [2024-11-19 07:01:14,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:14,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:14,993 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-19 07:01:14,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:14,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367042259] [2024-11-19 07:01:14,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367042259] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:01:14,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564663267] [2024-11-19 07:01:14,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:14,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:14,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:01:14,998 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-19 07:01:15,000 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-19 07:01:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:15,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 07:01:15,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:01:15,116 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-19 07:01:15,123 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-19 07:01:15,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:01:15,181 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-19 07:01:15,188 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:01:15,188 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-19 07:01:15,213 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-19 07:01:15,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:01:15,446 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-19 07:01:15,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564663267] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:01:15,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:01:15,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2024-11-19 07:01:15,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450731347] [2024-11-19 07:01:15,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:01:15,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 07:01:15,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:15,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 07:01:15,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:01:15,449 INFO L87 Difference]: Start difference. First operand 65 states and 71 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-19 07:01:15,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:15,585 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2024-11-19 07:01:15,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 07:01:15,586 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-19 07:01:15,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:15,587 INFO L225 Difference]: With dead ends: 64 [2024-11-19 07:01:15,587 INFO L226 Difference]: Without dead ends: 64 [2024-11-19 07:01:15,587 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-19 07:01:15,587 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 19 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:15,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 277 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:01:15,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-19 07:01:15,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-19 07:01:15,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:15,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2024-11-19 07:01:15,591 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 16 [2024-11-19 07:01:15,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:15,591 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2024-11-19 07:01:15,591 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-19 07:01:15,592 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2024-11-19 07:01:15,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 07:01:15,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:15,592 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:15,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 07:01:15,796 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-19 07:01:15,797 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:15,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:15,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969267, now seen corresponding path program 2 times [2024-11-19 07:01:15,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:15,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929537832] [2024-11-19 07:01:15,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:01:15,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:15,812 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 07:01:15,812 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:01:15,834 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-19 07:01:15,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:15,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929537832] [2024-11-19 07:01:15,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929537832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:01:15,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:01:15,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 07:01:15,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890882934] [2024-11-19 07:01:15,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:01:15,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 07:01:15,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:15,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 07:01:15,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 07:01:15,837 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:15,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:15,864 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2024-11-19 07:01:15,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 07:01:15,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-19 07:01:15,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:15,865 INFO L225 Difference]: With dead ends: 88 [2024-11-19 07:01:15,865 INFO L226 Difference]: Without dead ends: 88 [2024-11-19 07:01:15,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:01:15,866 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 23 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:15,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 160 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:01:15,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-19 07:01:15,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 66. [2024-11-19 07:01:15,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 65 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-19 07:01:15,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2024-11-19 07:01:15,870 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 22 [2024-11-19 07:01:15,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:15,870 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2024-11-19 07:01:15,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:15,870 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2024-11-19 07:01:15,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 07:01:15,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:15,871 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:15,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 07:01:15,871 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:15,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969322, now seen corresponding path program 1 times [2024-11-19 07:01:15,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:15,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174180432] [2024-11-19 07:01:15,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:15,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:15,928 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-19 07:01:15,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:15,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174180432] [2024-11-19 07:01:15,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174180432] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:01:15,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433252190] [2024-11-19 07:01:15,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:15,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:15,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:01:15,931 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-19 07:01:15,932 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-19 07:01:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:16,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 07:01:16,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:01:16,048 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-19 07:01:16,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:01:16,071 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-19 07:01:16,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433252190] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:01:16,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:01:16,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-19 07:01:16,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578367427] [2024-11-19 07:01:16,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:01:16,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 07:01:16,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:16,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 07:01:16,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 07:01:16,072 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:16,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:16,099 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2024-11-19 07:01:16,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 07:01:16,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-19 07:01:16,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:16,100 INFO L225 Difference]: With dead ends: 66 [2024-11-19 07:01:16,100 INFO L226 Difference]: Without dead ends: 66 [2024-11-19 07:01:16,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-19 07:01:16,101 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 4 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 155 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-19 07:01:16,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 155 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:01:16,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-19 07:01:16,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-19 07:01:16,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.411764705882353) internal successors, (72), 65 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-19 07:01:16,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2024-11-19 07:01:16,104 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 22 [2024-11-19 07:01:16,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:16,105 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2024-11-19 07:01:16,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:16,105 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2024-11-19 07:01:16,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 07:01:16,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:16,105 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:16,118 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-19 07:01:16,309 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-19 07:01:16,310 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:16,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:16,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022437, now seen corresponding path program 1 times [2024-11-19 07:01:16,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:16,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779724961] [2024-11-19 07:01:16,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:16,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:16,397 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-19 07:01:16,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:16,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779724961] [2024-11-19 07:01:16,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779724961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:01:16,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:01:16,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 07:01:16,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893458685] [2024-11-19 07:01:16,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:01:16,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 07:01:16,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:16,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 07:01:16,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 07:01:16,398 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 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-19 07:01:16,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:16,495 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2024-11-19 07:01:16,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 07:01:16,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 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 23 [2024-11-19 07:01:16,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:16,496 INFO L225 Difference]: With dead ends: 69 [2024-11-19 07:01:16,496 INFO L226 Difference]: Without dead ends: 69 [2024-11-19 07:01:16,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-19 07:01:16,497 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 47 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:16,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 174 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:01:16,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-19 07:01:16,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-19 07:01:16,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 68 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:16,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2024-11-19 07:01:16,499 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 23 [2024-11-19 07:01:16,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:16,500 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2024-11-19 07:01:16,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 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-19 07:01:16,500 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2024-11-19 07:01:16,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 07:01:16,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:16,500 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:16,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 07:01:16,501 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:16,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:16,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022436, now seen corresponding path program 1 times [2024-11-19 07:01:16,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:16,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932750455] [2024-11-19 07:01:16,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:16,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:16,668 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-19 07:01:16,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:16,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932750455] [2024-11-19 07:01:16,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932750455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:01:16,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:01:16,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 07:01:16,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110513328] [2024-11-19 07:01:16,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:01:16,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 07:01:16,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:16,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 07:01:16,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 07:01:16,672 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:16,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:16,763 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2024-11-19 07:01:16,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 07:01:16,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-19 07:01:16,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:16,764 INFO L225 Difference]: With dead ends: 69 [2024-11-19 07:01:16,766 INFO L226 Difference]: Without dead ends: 69 [2024-11-19 07:01:16,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-19 07:01:16,767 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 44 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:16,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 198 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:01:16,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-19 07:01:16,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-19 07:01:16,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 68 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-19 07:01:16,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2024-11-19 07:01:16,770 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 23 [2024-11-19 07:01:16,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:16,770 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2024-11-19 07:01:16,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:16,771 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2024-11-19 07:01:16,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 07:01:16,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:16,771 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:16,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 07:01:16,771 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:16,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:16,772 INFO L85 PathProgramCache]: Analyzing trace with hash -244809887, now seen corresponding path program 1 times [2024-11-19 07:01:16,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:16,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685900829] [2024-11-19 07:01:16,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:16,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:16,857 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-19 07:01:16,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:16,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685900829] [2024-11-19 07:01:16,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685900829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:01:16,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:01:16,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 07:01:16,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214258385] [2024-11-19 07:01:16,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:01:16,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 07:01:16,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:16,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 07:01:16,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 07:01:16,859 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:16,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:16,966 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2024-11-19 07:01:16,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 07:01:16,967 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-19 07:01:16,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:16,967 INFO L225 Difference]: With dead ends: 72 [2024-11-19 07:01:16,967 INFO L226 Difference]: Without dead ends: 72 [2024-11-19 07:01:16,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-19 07:01:16,968 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 45 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:16,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 174 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:01:16,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-19 07:01:16,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-19 07:01:16,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 71 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-19 07:01:16,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2024-11-19 07:01:16,970 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 25 [2024-11-19 07:01:16,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:16,974 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2024-11-19 07:01:16,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:16,974 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2024-11-19 07:01:16,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 07:01:16,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:16,975 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:16,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 07:01:16,975 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:16,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:16,975 INFO L85 PathProgramCache]: Analyzing trace with hash -244809886, now seen corresponding path program 1 times [2024-11-19 07:01:16,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:16,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489753897] [2024-11-19 07:01:16,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:16,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:17,067 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-19 07:01:17,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:17,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489753897] [2024-11-19 07:01:17,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489753897] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:01:17,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396847402] [2024-11-19 07:01:17,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:17,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:17,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:01:17,070 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-19 07:01:17,072 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-19 07:01:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:17,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 07:01:17,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:01:17,190 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-19 07:01:17,190 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 07:01:17,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396847402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:01:17,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 07:01:17,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-19 07:01:17,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741848083] [2024-11-19 07:01:17,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:01:17,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 07:01:17,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:17,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 07:01:17,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:01:17,191 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-19 07:01:17,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:17,204 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2024-11-19 07:01:17,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 07:01:17,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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 25 [2024-11-19 07:01:17,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:17,205 INFO L225 Difference]: With dead ends: 95 [2024-11-19 07:01:17,205 INFO L226 Difference]: Without dead ends: 95 [2024-11-19 07:01:17,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:01:17,205 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 76 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:17,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 109 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:01:17,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-19 07:01:17,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 73. [2024-11-19 07:01:17,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 72 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-19 07:01:17,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2024-11-19 07:01:17,210 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 25 [2024-11-19 07:01:17,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:17,210 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2024-11-19 07:01:17,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-19 07:01:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2024-11-19 07:01:17,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 07:01:17,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:17,211 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] [2024-11-19 07:01:17,232 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-19 07:01:17,411 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,SelfDestructingSolverStorable12 [2024-11-19 07:01:17,412 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:17,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:17,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1962551634, now seen corresponding path program 1 times [2024-11-19 07:01:17,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:17,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686748797] [2024-11-19 07:01:17,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:17,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:17,577 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 07:01:17,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:17,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686748797] [2024-11-19 07:01:17,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686748797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:01:17,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:01:17,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 07:01:17,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120813589] [2024-11-19 07:01:17,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:01:17,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 07:01:17,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:17,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 07:01:17,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 07:01:17,579 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:17,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:17,690 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2024-11-19 07:01:17,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 07:01:17,691 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-19 07:01:17,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:17,691 INFO L225 Difference]: With dead ends: 73 [2024-11-19 07:01:17,691 INFO L226 Difference]: Without dead ends: 73 [2024-11-19 07:01:17,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-19 07:01:17,692 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 37 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:17,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 198 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:01:17,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-19 07:01:17,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-19 07:01:17,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 72 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-19 07:01:17,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2024-11-19 07:01:17,694 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 30 [2024-11-19 07:01:17,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:17,694 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2024-11-19 07:01:17,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2024-11-19 07:01:17,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 07:01:17,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:17,695 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:17,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 07:01:17,695 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:17,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:17,696 INFO L85 PathProgramCache]: Analyzing trace with hash -669697558, now seen corresponding path program 1 times [2024-11-19 07:01:17,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:17,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642555839] [2024-11-19 07:01:17,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:17,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 07:01:17,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:17,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642555839] [2024-11-19 07:01:17,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642555839] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:01:17,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081446906] [2024-11-19 07:01:17,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:17,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:17,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:01:17,762 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-19 07:01:17,763 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-19 07:01:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:17,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 07:01:17,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:01:17,892 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 07:01:17,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:01:17,918 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 07:01:17,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081446906] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:01:17,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:01:17,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-11-19 07:01:17,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029464356] [2024-11-19 07:01:17,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:01:17,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 07:01:17,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:17,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 07:01:17,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 07:01:17,920 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:17,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:17,964 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2024-11-19 07:01:17,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 07:01:17,965 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-19 07:01:17,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:17,966 INFO L225 Difference]: With dead ends: 126 [2024-11-19 07:01:17,966 INFO L226 Difference]: Without dead ends: 126 [2024-11-19 07:01:17,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:01:17,966 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 60 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:17,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 201 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:01:17,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-19 07:01:17,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 81. [2024-11-19 07:01:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 80 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-19 07:01:17,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2024-11-19 07:01:17,968 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 31 [2024-11-19 07:01:17,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:17,968 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2024-11-19 07:01:17,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:17,969 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2024-11-19 07:01:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 07:01:17,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:17,969 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:17,986 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-19 07:01:18,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-19 07:01:18,170 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:18,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:18,171 INFO L85 PathProgramCache]: Analyzing trace with hash -669697613, now seen corresponding path program 1 times [2024-11-19 07:01:18,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:18,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343850071] [2024-11-19 07:01:18,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:18,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:18,679 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:01:18,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:18,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343850071] [2024-11-19 07:01:18,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343850071] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:01:18,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154101087] [2024-11-19 07:01:18,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:18,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:18,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:01:18,685 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-19 07:01:18,689 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-19 07:01:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:18,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-19 07:01:18,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:01:18,801 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-19 07:01:18,828 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:01:18,828 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-19 07:01:18,845 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 13 treesize of output 9 [2024-11-19 07:01:18,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-19 07:01:18,905 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 07:01:18,905 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 51 treesize of output 48 [2024-11-19 07:01:19,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:01:19,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:01:19,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:19,057 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 1 case distinctions, treesize of input 46 treesize of output 31 [2024-11-19 07:01:19,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:19,109 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 40 treesize of output 16 [2024-11-19 07:01:19,113 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:01:19,114 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:01:19,157 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_844 (Array Int Int))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_844) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) 1) (not (= v_ArrVal_844 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_844 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))))) is different from false [2024-11-19 07:01:19,278 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-19 07:01:19,278 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 21 treesize of output 20 [2024-11-19 07:01:19,925 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_843) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2024-11-19 07:01:19,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:19,944 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 2 case distinctions, treesize of input 27 treesize of output 33 [2024-11-19 07:01:19,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:19,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 28 [2024-11-19 07:01:19,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 07:01:20,013 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-19 07:01:20,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154101087] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:01:20,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:01:20,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 33 [2024-11-19 07:01:20,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142019166] [2024-11-19 07:01:20,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:01:20,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-19 07:01:20,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:20,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-19 07:01:20,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=894, Unknown=10, NotChecked=122, Total=1122 [2024-11-19 07:01:20,015 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 34 states, 33 states have (on average 2.393939393939394) internal successors, (79), 34 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-19 07:01:20,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:20,811 INFO L93 Difference]: Finished difference Result 128 states and 146 transitions. [2024-11-19 07:01:20,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 07:01:20,812 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.393939393939394) internal successors, (79), 34 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-19 07:01:20,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:20,813 INFO L225 Difference]: With dead ends: 128 [2024-11-19 07:01:20,813 INFO L226 Difference]: Without dead ends: 128 [2024-11-19 07:01:20,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=256, Invalid=1721, Unknown=11, NotChecked=174, Total=2162 [2024-11-19 07:01:20,815 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 135 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:20,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 688 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 735 Invalid, 0 Unknown, 163 Unchecked, 0.4s Time] [2024-11-19 07:01:20,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-19 07:01:20,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 91. [2024-11-19 07:01:20,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 76 states have (on average 1.381578947368421) internal successors, (105), 90 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:20,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2024-11-19 07:01:20,819 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 31 [2024-11-19 07:01:20,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:20,819 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2024-11-19 07:01:20,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.393939393939394) internal successors, (79), 34 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-19 07:01:20,819 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2024-11-19 07:01:20,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 07:01:20,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:20,820 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:20,844 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-19 07:01:21,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:21,022 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:21,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:21,022 INFO L85 PathProgramCache]: Analyzing trace with hash -669697612, now seen corresponding path program 1 times [2024-11-19 07:01:21,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:21,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731039362] [2024-11-19 07:01:21,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:21,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:21,744 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:01:21,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:21,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731039362] [2024-11-19 07:01:21,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731039362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:01:21,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724556104] [2024-11-19 07:01:21,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:21,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:21,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:01:21,746 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-19 07:01:21,747 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-19 07:01:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:21,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-19 07:01:21,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:01:21,861 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-19 07:01:21,919 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:01:21,920 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-19 07:01:21,950 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 13 treesize of output 9 [2024-11-19 07:01:21,965 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 13 treesize of output 9 [2024-11-19 07:01:21,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-19 07:01:22,003 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 29 treesize of output 13 [2024-11-19 07:01:22,051 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 07:01:22,052 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 79 treesize of output 72 [2024-11-19 07:01:22,056 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 49 treesize of output 30 [2024-11-19 07:01:22,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:01:22,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:01:22,268 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 54 treesize of output 39 [2024-11-19 07:01:22,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:01:22,284 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 44 treesize of output 26 [2024-11-19 07:01:22,364 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 0 case distinctions, treesize of input 48 treesize of output 24 [2024-11-19 07:01:22,368 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 32 treesize of output 14 [2024-11-19 07:01:22,425 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:01:22,426 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:01:22,595 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_957 (Array Int Int))) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_957) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 1)) (not (= (store .cse1 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_957 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_957)))) (forall ((v_ArrVal_958 (Array Int Int))) (or (not (= v_ArrVal_958 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_958 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_957 (Array Int Int))) (or (< (+ 3 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_957) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (not (= (store .cse1 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_957 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_957)))))))) is different from false [2024-11-19 07:01:22,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:22,800 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 46 treesize of output 50 [2024-11-19 07:01:22,828 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_956 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_956) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) (forall ((v_ArrVal_955 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_955) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9))))) is different from false [2024-11-19 07:01:22,844 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_956 (Array Int Int)) (v_ArrVal_954 Int)) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_954)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_956) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (forall ((v_ArrVal_955 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_955) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_2 (Array Int Int)) (v_ArrVal_954 Int)) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_954)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9))))) is different from false [2024-11-19 07:01:22,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:22,856 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 2 case distinctions, treesize of input 27 treesize of output 33 [2024-11-19 07:01:22,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:22,861 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 46 treesize of output 28 [2024-11-19 07:01:22,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 07:01:22,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:22,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2024-11-19 07:01:22,875 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:01:22,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-19 07:01:22,882 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-19 07:01:22,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 1 [2024-11-19 07:01:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2024-11-19 07:01:23,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724556104] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:01:23,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:01:23,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2024-11-19 07:01:23,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274342679] [2024-11-19 07:01:23,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:01:23,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-19 07:01:23,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:23,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-19 07:01:23,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1233, Unknown=3, NotChecked=216, Total=1560 [2024-11-19 07:01:23,030 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand has 40 states, 39 states have (on average 2.230769230769231) internal successors, (87), 40 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:24,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:24,051 INFO L93 Difference]: Finished difference Result 138 states and 159 transitions. [2024-11-19 07:01:24,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 07:01:24,052 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.230769230769231) internal successors, (87), 40 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-19 07:01:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:24,052 INFO L225 Difference]: With dead ends: 138 [2024-11-19 07:01:24,052 INFO L226 Difference]: Without dead ends: 138 [2024-11-19 07:01:24,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=264, Invalid=2195, Unknown=3, NotChecked=294, Total=2756 [2024-11-19 07:01:24,053 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 138 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 231 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:24,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1023 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 982 Invalid, 0 Unknown, 231 Unchecked, 0.4s Time] [2024-11-19 07:01:24,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-19 07:01:24,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 99. [2024-11-19 07:01:24,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 84 states have (on average 1.380952380952381) internal successors, (116), 98 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 116 transitions. [2024-11-19 07:01:24,056 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 116 transitions. Word has length 31 [2024-11-19 07:01:24,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:24,056 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 116 transitions. [2024-11-19 07:01:24,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.230769230769231) internal successors, (87), 40 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:24,056 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 116 transitions. [2024-11-19 07:01:24,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 07:01:24,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:24,057 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-19 07:01:24,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-19 07:01:24,257 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,SelfDestructingSolverStorable16 [2024-11-19 07:01:24,258 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:24,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:24,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1015753968, now seen corresponding path program 1 times [2024-11-19 07:01:24,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:24,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360935675] [2024-11-19 07:01:24,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:24,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:24,301 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 07:01:24,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:24,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360935675] [2024-11-19 07:01:24,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360935675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:01:24,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:01:24,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 07:01:24,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296697702] [2024-11-19 07:01:24,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:01:24,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 07:01:24,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:24,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 07:01:24,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 07:01:24,303 INFO L87 Difference]: Start difference. First operand 99 states and 116 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:24,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:24,321 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2024-11-19 07:01:24,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 07:01:24,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-19 07:01:24,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:24,322 INFO L225 Difference]: With dead ends: 109 [2024-11-19 07:01:24,322 INFO L226 Difference]: Without dead ends: 109 [2024-11-19 07:01:24,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:01:24,323 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 14 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:24,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 164 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:01:24,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-19 07:01:24,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 100. [2024-11-19 07:01:24,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 85 states have (on average 1.3764705882352941) internal successors, (117), 99 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:24,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2024-11-19 07:01:24,324 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 33 [2024-11-19 07:01:24,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:24,324 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2024-11-19 07:01:24,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:24,325 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2024-11-19 07:01:24,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 07:01:24,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:24,325 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] [2024-11-19 07:01:24,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 07:01:24,327 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:24,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:24,327 INFO L85 PathProgramCache]: Analyzing trace with hash 928411696, now seen corresponding path program 1 times [2024-11-19 07:01:24,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:24,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709958450] [2024-11-19 07:01:24,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:24,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:24,430 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-19 07:01:24,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:24,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709958450] [2024-11-19 07:01:24,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709958450] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:01:24,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415275235] [2024-11-19 07:01:24,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:24,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:24,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:01:24,432 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-19 07:01:24,433 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-19 07:01:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:24,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 07:01:24,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:01:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 07:01:24,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:01:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 07:01:24,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415275235] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:01:24,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:01:24,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-19 07:01:24,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962320787] [2024-11-19 07:01:24,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:01:24,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 07:01:24,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:24,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 07:01:24,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-19 07:01:24,642 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:24,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:24,681 INFO L93 Difference]: Finished difference Result 135 states and 153 transitions. [2024-11-19 07:01:24,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 07:01:24,682 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-19 07:01:24,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:24,683 INFO L225 Difference]: With dead ends: 135 [2024-11-19 07:01:24,683 INFO L226 Difference]: Without dead ends: 135 [2024-11-19 07:01:24,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:01:24,683 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 103 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:24,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 247 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:01:24,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-19 07:01:24,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 106. [2024-11-19 07:01:24,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 105 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2024-11-19 07:01:24,688 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 36 [2024-11-19 07:01:24,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:24,688 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions. [2024-11-19 07:01:24,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:24,688 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2024-11-19 07:01:24,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 07:01:24,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:24,689 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:24,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-19 07:01:24,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:24,893 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:24,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:24,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1013618178, now seen corresponding path program 2 times [2024-11-19 07:01:24,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:24,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106609089] [2024-11-19 07:01:24,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:01:24,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:24,910 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 07:01:24,910 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:01:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 07:01:24,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:24,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106609089] [2024-11-19 07:01:24,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106609089] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:01:24,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512196848] [2024-11-19 07:01:24,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:01:24,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:24,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:01:24,984 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-19 07:01:24,996 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-19 07:01:25,132 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 07:01:25,132 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:01:25,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 07:01:25,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:01:25,214 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 07:01:25,215 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 07:01:25,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512196848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:01:25,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 07:01:25,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-11-19 07:01:25,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299814521] [2024-11-19 07:01:25,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:01:25,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:01:25,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:25,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:01:25,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:01:25,217 INFO L87 Difference]: Start difference. First operand 106 states and 123 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:25,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:25,236 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2024-11-19 07:01:25,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 07:01:25,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-19 07:01:25,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:25,237 INFO L225 Difference]: With dead ends: 86 [2024-11-19 07:01:25,237 INFO L226 Difference]: Without dead ends: 86 [2024-11-19 07:01:25,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:01:25,238 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 28 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:25,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 168 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:01:25,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-19 07:01:25,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2024-11-19 07:01:25,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:25,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2024-11-19 07:01:25,241 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 39 [2024-11-19 07:01:25,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:25,241 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2024-11-19 07:01:25,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:25,241 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2024-11-19 07:01:25,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 07:01:25,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:25,242 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:25,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-19 07:01:25,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:25,443 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:25,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:25,443 INFO L85 PathProgramCache]: Analyzing trace with hash 294244708, now seen corresponding path program 2 times [2024-11-19 07:01:25,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:25,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37027846] [2024-11-19 07:01:25,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:01:25,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:25,464 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 07:01:25,464 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:01:25,526 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 07:01:25,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:25,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37027846] [2024-11-19 07:01:25,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37027846] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:01:25,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840416747] [2024-11-19 07:01:25,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:01:25,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:25,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:01:25,529 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:01:25,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 07:01:25,659 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 07:01:25,660 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:01:25,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 07:01:25,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:01:25,677 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 07:01:25,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:01:25,698 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 07:01:25,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840416747] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:01:25,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:01:25,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-19 07:01:25,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022895681] [2024-11-19 07:01:25,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:01:25,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:01:25,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:25,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:01:25,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:01:25,700 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:25,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:25,728 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2024-11-19 07:01:25,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 07:01:25,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-19 07:01:25,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:25,729 INFO L225 Difference]: With dead ends: 82 [2024-11-19 07:01:25,729 INFO L226 Difference]: Without dead ends: 82 [2024-11-19 07:01:25,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-19 07:01:25,730 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 66 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:25,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 178 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:01:25,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-19 07:01:25,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2024-11-19 07:01:25,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.2238805970149254) 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-19 07:01:25,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-11-19 07:01:25,731 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 41 [2024-11-19 07:01:25,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:25,731 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-11-19 07:01:25,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:25,732 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-11-19 07:01:25,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 07:01:25,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:25,732 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:25,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-19 07:01:25,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-19 07:01:25,934 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:25,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:25,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1726931736, now seen corresponding path program 1 times [2024-11-19 07:01:25,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:25,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117607558] [2024-11-19 07:01:25,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:25,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:26,678 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:01:26,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:26,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117607558] [2024-11-19 07:01:26,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117607558] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:01:26,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374331772] [2024-11-19 07:01:26,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:26,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:26,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:01:26,680 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:01:26,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-19 07:01:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:26,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-19 07:01:26,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:01:26,824 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-19 07:01:26,874 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:01:26,875 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-19 07:01:26,898 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 13 treesize of output 9 [2024-11-19 07:01:26,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-19 07:01:26,977 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 07:01:26,978 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 40 treesize of output 39 [2024-11-19 07:01:27,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:27,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2024-11-19 07:01:27,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:01:27,237 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 0 case distinctions, treesize of input 29 treesize of output 11 [2024-11-19 07:01:27,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 07:01:27,452 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:01:27,452 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:01:27,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:27,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2024-11-19 07:01:27,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:27,698 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 48 treesize of output 51 [2024-11-19 07:01:27,702 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 18 treesize of output 16 [2024-11-19 07:01:27,902 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1466 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1466) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) is different from false [2024-11-19 07:01:27,907 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1466 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1466) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) is different from false [2024-11-19 07:01:27,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:27,917 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 2 case distinctions, treesize of input 28 treesize of output 34 [2024-11-19 07:01:27,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:27,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 31 [2024-11-19 07:01:27,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-19 07:01:27,994 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-19 07:01:27,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374331772] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:01:27,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:01:27,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 59 [2024-11-19 07:01:27,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205649135] [2024-11-19 07:01:27,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:01:27,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-19 07:01:27,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:27,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-19 07:01:27,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2943, Unknown=49, NotChecked=222, Total=3422 [2024-11-19 07:01:27,997 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 59 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 59 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-19 07:01:29,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:29,076 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2024-11-19 07:01:29,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-19 07:01:29,078 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 59 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 44 [2024-11-19 07:01:29,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:29,079 INFO L225 Difference]: With dead ends: 84 [2024-11-19 07:01:29,079 INFO L226 Difference]: Without dead ends: 84 [2024-11-19 07:01:29,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1443 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=528, Invalid=5436, Unknown=50, NotChecked=306, Total=6320 [2024-11-19 07:01:29,081 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 120 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:29,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 986 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1120 Invalid, 0 Unknown, 130 Unchecked, 0.5s Time] [2024-11-19 07:01:29,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-19 07:01:29,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2024-11-19 07:01:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.208955223880597) internal successors, (81), 77 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:29,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2024-11-19 07:01:29,083 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 44 [2024-11-19 07:01:29,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:29,083 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2024-11-19 07:01:29,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 59 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-19 07:01:29,084 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2024-11-19 07:01:29,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 07:01:29,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:29,084 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:29,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-19 07:01:29,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-19 07:01:29,285 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:29,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:29,285 INFO L85 PathProgramCache]: Analyzing trace with hash 594303695, now seen corresponding path program 1 times [2024-11-19 07:01:29,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:29,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192816076] [2024-11-19 07:01:29,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:29,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:30,002 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 07:01:30,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:30,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192816076] [2024-11-19 07:01:30,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192816076] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:01:30,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662307604] [2024-11-19 07:01:30,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:30,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:30,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:01:30,004 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:01:30,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-19 07:01:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:30,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-19 07:01:30,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:01:30,159 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-19 07:01:30,189 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:01:30,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:01:30,206 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 13 treesize of output 9 [2024-11-19 07:01:30,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-19 07:01:30,260 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 07:01:30,261 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 51 treesize of output 48 [2024-11-19 07:01:30,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:01:30,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:01:30,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:30,404 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 1 case distinctions, treesize of input 46 treesize of output 31 [2024-11-19 07:01:30,540 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 07:01:30,540 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 51 treesize of output 48 [2024-11-19 07:01:30,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:30,617 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 40 treesize of output 16 [2024-11-19 07:01:30,620 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 07:01:30,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:01:30,678 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1592 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1592) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) 1)) is different from false [2024-11-19 07:01:30,683 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1592 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1592) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) 1)) is different from false [2024-11-19 07:01:30,729 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1592 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_1592) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) 1)) is different from false [2024-11-19 07:01:30,738 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1592 (Array Int Int)) (v_ArrVal_1591 (Array Int Int))) (or (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1591 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_1591)) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1591))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_1592)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) 1))) is different from false [2024-11-19 07:01:30,753 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1592 (Array Int Int)) (v_ArrVal_1591 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| (select v_ArrVal_1591 |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|)) v_ArrVal_1591)) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1591) (select v_ArrVal_1591 .cse0) v_ArrVal_1592) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) 1) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|))) is different from false [2024-11-19 07:01:30,763 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1592 (Array Int Int)) (v_ArrVal_1591 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_1591) (select v_ArrVal_1591 .cse0) v_ArrVal_1592) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse0))) 1) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| (select v_ArrVal_1591 |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|)) v_ArrVal_1591)))) is different from false [2024-11-19 07:01:30,775 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1592 (Array Int Int)) (v_ArrVal_1591 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (not (= v_ArrVal_1591 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| (select v_ArrVal_1591 |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|)))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1591) (select v_ArrVal_1591 .cse0) v_ArrVal_1592) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0))) 1))) is different from false [2024-11-19 07:01:30,791 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1592 (Array Int Int)) (v_ArrVal_1591 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| (select v_ArrVal_1591 |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|)) v_ArrVal_1591)) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1591) (select v_ArrVal_1591 .cse0) v_ArrVal_1592) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) 1) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|))) is different from false [2024-11-19 07:01:30,803 INFO L349 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2024-11-19 07:01:30,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2024-11-19 07:01:30,813 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1592 (Array Int Int)) (v_ArrVal_1591 (Array Int Int)) (v_ArrVal_1590 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1590))) (or (not (= v_ArrVal_1591 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| (select v_ArrVal_1591 |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|)))) (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1591) (select v_ArrVal_1591 .cse1) v_ArrVal_1592) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|)))) is different from false [2024-11-19 07:01:30,834 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1592 (Array Int Int)) (v_ArrVal_1591 (Array Int Int)) (v_ArrVal_1590 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_46| Int)) (or (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1590) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1591) (select v_ArrVal_1591 .cse0) v_ArrVal_1592) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1590) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_46| (select v_ArrVal_1591 |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|)) v_ArrVal_1591)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_46|))) is different from false [2024-11-19 07:01:30,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:30,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 66 [2024-11-19 07:01:30,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2024-11-19 07:01:30,866 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:01:30,867 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:01:30,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:30,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 56 [2024-11-19 07:01:30,881 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 07:01:30,882 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 23 treesize of output 18 [2024-11-19 07:01:30,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-19 07:01:30,896 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:01:30,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2024-11-19 07:01:30,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:30,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 07:01:30,952 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 13 not checked. [2024-11-19 07:01:30,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662307604] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:01:30,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:01:30,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 46 [2024-11-19 07:01:30,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635337245] [2024-11-19 07:01:30,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:01:30,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-19 07:01:30,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:30,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-19 07:01:30,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1222, Unknown=26, NotChecked=790, Total=2162 [2024-11-19 07:01:30,954 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 47 states, 46 states have (on average 2.8260869565217392) internal successors, (130), 47 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:31,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:31,875 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2024-11-19 07:01:31,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 07:01:31,876 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.8260869565217392) internal successors, (130), 47 states have internal predecessors, (130), 0 states have call successors, (0), 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-19 07:01:31,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:31,876 INFO L225 Difference]: With dead ends: 88 [2024-11-19 07:01:31,876 INFO L226 Difference]: Without dead ends: 88 [2024-11-19 07:01:31,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=303, Invalid=2463, Unknown=30, NotChecked=1110, Total=3906 [2024-11-19 07:01:31,877 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 124 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 720 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:31,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 864 Invalid, 1727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 992 Invalid, 0 Unknown, 720 Unchecked, 0.4s Time] [2024-11-19 07:01:31,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-19 07:01:31,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2024-11-19 07:01:31,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 81 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-19 07:01:31,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2024-11-19 07:01:31,880 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 48 [2024-11-19 07:01:31,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:31,881 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2024-11-19 07:01:31,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.8260869565217392) internal successors, (130), 47 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:31,881 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2024-11-19 07:01:31,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 07:01:31,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:31,881 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:31,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-19 07:01:32,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-19 07:01:32,086 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:32,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:32,087 INFO L85 PathProgramCache]: Analyzing trace with hash 594303696, now seen corresponding path program 1 times [2024-11-19 07:01:32,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:32,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946051157] [2024-11-19 07:01:32,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:32,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:33,024 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 07:01:33,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:33,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946051157] [2024-11-19 07:01:33,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946051157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:01:33,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261046492] [2024-11-19 07:01:33,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:33,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:33,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:01:33,026 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:01:33,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-19 07:01:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:33,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-19 07:01:33,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:01:33,171 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-19 07:01:33,218 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:01:33,218 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-19 07:01:33,237 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 13 treesize of output 9 [2024-11-19 07:01:33,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-19 07:01:33,286 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 07:01:33,286 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 40 treesize of output 39 [2024-11-19 07:01:33,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:01:33,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:01:33,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:33,428 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 1 case distinctions, treesize of input 35 treesize of output 26 [2024-11-19 07:01:33,567 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 07:01:33,568 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 79 treesize of output 72 [2024-11-19 07:01:33,571 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 49 treesize of output 30 [2024-11-19 07:01:33,740 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 0 case distinctions, treesize of input 48 treesize of output 24 [2024-11-19 07:01:33,742 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 32 treesize of output 14 [2024-11-19 07:01:33,791 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 07:01:33,791 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:01:33,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:33,892 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 46 treesize of output 50 [2024-11-19 07:01:34,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:34,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 127 treesize of output 108 [2024-11-19 07:01:34,033 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 89 treesize of output 85 [2024-11-19 07:01:34,037 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 85 treesize of output 81 [2024-11-19 07:01:34,116 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1713 (Array Int Int))) (or (not (= v_ArrVal_1713 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1713 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2024-11-19 07:01:34,239 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1712 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1712) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) is different from false [2024-11-19 07:01:34,244 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1712 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1712) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) is different from false [2024-11-19 07:01:34,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:34,251 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 2 case distinctions, treesize of input 28 treesize of output 34 [2024-11-19 07:01:34,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:34,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 31 [2024-11-19 07:01:34,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-19 07:01:34,311 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 5 not checked. [2024-11-19 07:01:34,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261046492] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:01:34,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:01:34,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 49 [2024-11-19 07:01:34,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809703038] [2024-11-19 07:01:34,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:01:34,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-19 07:01:34,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:34,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-19 07:01:34,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2013, Unknown=3, NotChecked=276, Total=2450 [2024-11-19 07:01:34,313 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 50 states, 49 states have (on average 2.7551020408163267) internal successors, (135), 50 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:35,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:35,296 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2024-11-19 07:01:35,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 07:01:35,297 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.7551020408163267) internal successors, (135), 50 states have internal predecessors, (135), 0 states have call successors, (0), 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-19 07:01:35,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:35,297 INFO L225 Difference]: With dead ends: 88 [2024-11-19 07:01:35,297 INFO L226 Difference]: Without dead ends: 88 [2024-11-19 07:01:35,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=366, Invalid=3549, Unknown=3, NotChecked=372, Total=4290 [2024-11-19 07:01:35,298 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 126 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:35,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 976 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 969 Invalid, 0 Unknown, 195 Unchecked, 0.4s Time] [2024-11-19 07:01:35,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-19 07:01:35,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2024-11-19 07:01:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 80 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2024-11-19 07:01:35,300 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 48 [2024-11-19 07:01:35,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:35,300 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2024-11-19 07:01:35,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.7551020408163267) internal successors, (135), 50 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:35,300 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2024-11-19 07:01:35,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 07:01:35,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:35,301 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:35,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-19 07:01:35,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:35,501 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:35,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:35,502 INFO L85 PathProgramCache]: Analyzing trace with hash -307265039, now seen corresponding path program 1 times [2024-11-19 07:01:35,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:35,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850702061] [2024-11-19 07:01:35,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:35,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:35,565 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 07:01:35,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:35,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850702061] [2024-11-19 07:01:35,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850702061] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:01:35,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877002660] [2024-11-19 07:01:35,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:35,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:35,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:01:35,567 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:01:35,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-19 07:01:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:35,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 07:01:35,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:01:35,754 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 07:01:35,755 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:01:35,773 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 07:01:35,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877002660] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:01:35,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:01:35,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-19 07:01:35,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574911848] [2024-11-19 07:01:35,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:01:35,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:01:35,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:35,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:01:35,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:01:35,775 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:35,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:35,804 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2024-11-19 07:01:35,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 07:01:35,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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 51 [2024-11-19 07:01:35,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:35,805 INFO L225 Difference]: With dead ends: 81 [2024-11-19 07:01:35,805 INFO L226 Difference]: Without dead ends: 81 [2024-11-19 07:01:35,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-19 07:01:35,806 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 37 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:35,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 191 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:01:35,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-19 07:01:35,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-19 07:01:35,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.2) internal successors, (84), 80 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:35,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2024-11-19 07:01:35,807 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 51 [2024-11-19 07:01:35,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:35,807 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2024-11-19 07:01:35,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:35,807 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2024-11-19 07:01:35,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 07:01:35,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:35,808 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:35,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-19 07:01:36,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:36,013 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:36,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:36,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1047895438, now seen corresponding path program 2 times [2024-11-19 07:01:36,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:36,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544930485] [2024-11-19 07:01:36,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:01:36,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:36,031 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 07:01:36,031 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:01:36,098 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-19 07:01:36,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:36,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544930485] [2024-11-19 07:01:36,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544930485] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:01:36,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777212843] [2024-11-19 07:01:36,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:01:36,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:36,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:01:36,101 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:01:36,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-19 07:01:36,264 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 07:01:36,265 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:01:36,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 07:01:36,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:01:36,304 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-19 07:01:36,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:01:36,352 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-19 07:01:36,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777212843] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:01:36,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:01:36,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-19 07:01:36,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776987696] [2024-11-19 07:01:36,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:01:36,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:01:36,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:36,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:01:36,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:01:36,354 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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-19 07:01:36,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:36,370 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2024-11-19 07:01:36,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 07:01:36,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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 51 [2024-11-19 07:01:36,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:36,371 INFO L225 Difference]: With dead ends: 72 [2024-11-19 07:01:36,371 INFO L226 Difference]: Without dead ends: 72 [2024-11-19 07:01:36,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-19 07:01:36,372 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 14 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:36,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 154 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:01:36,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-19 07:01:36,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-19 07:01:36,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.123076923076923) internal successors, (73), 71 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-19 07:01:36,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2024-11-19 07:01:36,373 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 51 [2024-11-19 07:01:36,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:36,374 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2024-11-19 07:01:36,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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-19 07:01:36,374 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2024-11-19 07:01:36,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 07:01:36,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:36,377 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:36,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-19 07:01:36,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-19 07:01:36,578 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:36,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:36,578 INFO L85 PathProgramCache]: Analyzing trace with hash 677237458, now seen corresponding path program 1 times [2024-11-19 07:01:36,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:36,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401076585] [2024-11-19 07:01:36,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:36,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:37,926 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:01:37,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:37,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401076585] [2024-11-19 07:01:37,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401076585] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:01:37,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177582983] [2024-11-19 07:01:37,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:37,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:37,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:01:37,928 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:01:37,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-19 07:01:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:38,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-11-19 07:01:38,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:01:38,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 07:01:38,214 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:01:38,214 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-19 07:01:38,253 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 13 treesize of output 9 [2024-11-19 07:01:38,258 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 13 treesize of output 9 [2024-11-19 07:01:38,293 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 29 treesize of output 13 [2024-11-19 07:01:38,296 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 22 [2024-11-19 07:01:38,358 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 07:01:38,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 55 [2024-11-19 07:01:38,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 07:01:38,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:01:38,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:01:38,597 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 35 treesize of output 26 [2024-11-19 07:01:38,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:01:38,603 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 25 treesize of output 13 [2024-11-19 07:01:38,881 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 07:01:38,881 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 83 treesize of output 74 [2024-11-19 07:01:38,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 07:01:38,887 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 23 treesize of output 13 [2024-11-19 07:01:39,169 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 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-19 07:01:39,172 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-19 07:01:39,332 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:01:39,332 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:01:39,485 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 86 treesize of output 64 [2024-11-19 07:01:39,492 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_2077 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2077) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (forall ((v_ArrVal_2074 (Array Int Int))) (= |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2074) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (= |c_ULTIMATE.start_dll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)))) is different from false [2024-11-19 07:01:39,505 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_2077 (Array Int Int))) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2077) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_ArrVal_2074 (Array Int Int))) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2074) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2024-11-19 07:01:39,597 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (and (forall ((v_ArrVal_2074 (Array Int Int))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_2074) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_ArrVal_2077 (Array Int Int))) (= .cse1 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_2077) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2024-11-19 07:01:39,695 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|))) (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_2072 (Array Int Int))) (or (forall ((v_ArrVal_2077 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2072))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2077) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) (not (= (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2072 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_2072)))) (forall ((v_ArrVal_2072 (Array Int Int))) (or (forall ((v_ArrVal_2073 (Array Int Int))) (or (forall ((v_ArrVal_2074 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2073))) (= (select (select (store .cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2072) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_2074) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))) (not (= v_ArrVal_2073 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2073 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))))) (not (= (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2072 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_2072)))))) is different from false [2024-11-19 07:01:39,738 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_67| Int)) (or (forall ((v_ArrVal_2072 (Array Int Int))) (or (not (= v_ArrVal_2072 (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_67| (select v_ArrVal_2072 |v_ULTIMATE.start_dll_update_at_~head#1.offset_67|)))) (forall ((v_ArrVal_2077 (Array Int Int))) (let ((.cse1 (select v_ArrVal_2072 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2072) .cse1 v_ArrVal_2077) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_67|))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_67| Int) (v_ArrVal_2074 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_67|) (= (select v_ArrVal_2073 .cse2) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2073) (select .cse0 .cse2) v_ArrVal_2074) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) (not (= (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_67| (select v_ArrVal_2073 |v_ULTIMATE.start_dll_update_at_~head#1.offset_67|)) v_ArrVal_2073)))))) is different from false [2024-11-19 07:01:39,757 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_67| Int)) (or (forall ((v_ArrVal_2072 (Array Int Int))) (or (forall ((v_ArrVal_2077 (Array Int Int))) (let ((.cse0 (select v_ArrVal_2072 .cse1))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2072) .cse0 v_ArrVal_2077) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse1)))) (not (= (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_67| (select v_ArrVal_2072 |v_ULTIMATE.start_dll_update_at_~head#1.offset_67|)) v_ArrVal_2072)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_67|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_67| Int) (v_ArrVal_2074 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (or (not (= v_ArrVal_2073 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_67| (select v_ArrVal_2073 |v_ULTIMATE.start_dll_update_at_~head#1.offset_67|)))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2073) (select .cse2 .cse1) v_ArrVal_2074) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse1) (select v_ArrVal_2073 .cse1)) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_67|))))) is different from false [2024-11-19 07:01:39,776 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_67| Int) (v_ArrVal_2074 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2073) (select .cse0 .cse1) v_ArrVal_2074) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1) (select v_ArrVal_2073 .cse1)) (not (= v_ArrVal_2073 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_67| (select v_ArrVal_2073 |v_ULTIMATE.start_dll_update_at_~head#1.offset_67|)))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_67|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_67| Int)) (or (forall ((v_ArrVal_2072 (Array Int Int))) (or (forall ((v_ArrVal_2077 (Array Int Int))) (let ((.cse2 (select v_ArrVal_2072 .cse1))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2072) .cse2 v_ArrVal_2077) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1) .cse2))) (not (= (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_67| (select v_ArrVal_2072 |v_ULTIMATE.start_dll_update_at_~head#1.offset_67|)) v_ArrVal_2072)))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_67|))))) is different from false [2024-11-19 07:01:39,809 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_67| Int) (v_ArrVal_2074 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2073) (select .cse0 .cse1) v_ArrVal_2074) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) (select v_ArrVal_2073 .cse1)) (not (= (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_67| (select v_ArrVal_2073 |v_ULTIMATE.start_dll_update_at_~head#1.offset_67|)) v_ArrVal_2073)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_67|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_67| Int)) (or (forall ((v_ArrVal_2072 (Array Int Int))) (or (not (= v_ArrVal_2072 (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_67| (select v_ArrVal_2072 |v_ULTIMATE.start_dll_update_at_~head#1.offset_67|)))) (forall ((v_ArrVal_2077 (Array Int Int))) (let ((.cse2 (select v_ArrVal_2072 .cse1))) (= .cse2 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2072) .cse2 v_ArrVal_2077) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_67|))))) is different from false [2024-11-19 07:01:39,834 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_2071 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_67| Int)) (or (forall ((v_ArrVal_2072 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2071))) (or (forall ((v_ArrVal_2077 (Array Int Int))) (let ((.cse1 (select v_ArrVal_2072 .cse2))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2072) .cse1 v_ArrVal_2077) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) .cse1))) (not (= (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_67| (select v_ArrVal_2072 |v_ULTIMATE.start_dll_update_at_~head#1.offset_67|)) v_ArrVal_2072))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_67|))) (forall ((v_ArrVal_2071 (Array Int Int)) (v_ArrVal_2070 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_67| Int) (v_ArrVal_2074 (Array Int Int)) (v_ArrVal_2073 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2070))) (or (= (select (select (store (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2073) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2071) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) v_ArrVal_2074) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) (select v_ArrVal_2073 .cse2)) (not (= (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_67| (select v_ArrVal_2073 |v_ULTIMATE.start_dll_update_at_~head#1.offset_67|)) v_ArrVal_2073)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_67|)))))) is different from false [2024-11-19 07:01:40,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:40,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 62 [2024-11-19 07:01:40,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2024-11-19 07:01:40,030 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 07:01:40,030 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 28 treesize of output 23 [2024-11-19 07:01:40,036 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:01:40,037 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:01:40,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:40,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 51 [2024-11-19 07:01:40,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:01:40,062 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:01:40,063 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:01:40,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2024-11-19 07:01:40,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-19 07:01:40,069 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:01:40,073 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-19 07:01:40,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 1 [2024-11-19 07:01:40,193 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-11-19 07:01:40,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177582983] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:01:40,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:01:40,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 26] total 73 [2024-11-19 07:01:40,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331335429] [2024-11-19 07:01:40,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:01:40,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-11-19 07:01:40,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:40,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-11-19 07:01:40,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=3809, Unknown=46, NotChecked=1188, Total=5256 [2024-11-19 07:01:40,196 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 73 states, 73 states have (on average 2.0136986301369864) internal successors, (147), 73 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:42,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:42,303 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2024-11-19 07:01:42,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-19 07:01:42,304 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 2.0136986301369864) internal successors, (147), 73 states have internal predecessors, (147), 0 states have call successors, (0), 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 54 [2024-11-19 07:01:42,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:42,304 INFO L225 Difference]: With dead ends: 74 [2024-11-19 07:01:42,304 INFO L226 Difference]: Without dead ends: 74 [2024-11-19 07:01:42,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=537, Invalid=7109, Unknown=46, NotChecked=1620, Total=9312 [2024-11-19 07:01:42,306 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 99 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 2001 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 529 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:42,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1375 Invalid, 2547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2001 Invalid, 0 Unknown, 529 Unchecked, 0.8s Time] [2024-11-19 07:01:42,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-19 07:01:42,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2024-11-19 07:01:42,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 67 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2024-11-19 07:01:42,309 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 54 [2024-11-19 07:01:42,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:42,309 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2024-11-19 07:01:42,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 2.0136986301369864) internal successors, (147), 73 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:42,309 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2024-11-19 07:01:42,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-19 07:01:42,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:42,310 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:42,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-19 07:01:42,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-19 07:01:42,510 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:42,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:42,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1981317609, now seen corresponding path program 1 times [2024-11-19 07:01:42,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:42,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766561266] [2024-11-19 07:01:42,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:42,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 07:01:42,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:42,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766561266] [2024-11-19 07:01:42,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766561266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:01:42,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:01:42,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 07:01:42,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766429808] [2024-11-19 07:01:42,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:01:42,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 07:01:42,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:42,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 07:01:42,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 07:01:42,602 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:42,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:42,686 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2024-11-19 07:01:42,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 07:01:42,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-19 07:01:42,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:42,687 INFO L225 Difference]: With dead ends: 69 [2024-11-19 07:01:42,687 INFO L226 Difference]: Without dead ends: 69 [2024-11-19 07:01:42,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 07:01:42,688 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:42,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 109 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:01:42,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-19 07:01:42,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-19 07:01:42,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.125) internal successors, (72), 68 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-19 07:01:42,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2024-11-19 07:01:42,691 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 56 [2024-11-19 07:01:42,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:42,691 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-11-19 07:01:42,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:42,692 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2024-11-19 07:01:42,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-19 07:01:42,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:42,692 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:42,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 07:01:42,693 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:42,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:42,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1981317608, now seen corresponding path program 1 times [2024-11-19 07:01:42,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:42,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793341282] [2024-11-19 07:01:42,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:42,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 07:01:42,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:42,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793341282] [2024-11-19 07:01:42,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793341282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:01:42,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:01:42,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 07:01:42,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050577482] [2024-11-19 07:01:42,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:01:42,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 07:01:42,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:42,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 07:01:42,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 07:01:42,844 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 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-19 07:01:42,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:42,931 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2024-11-19 07:01:42,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 07:01:42,931 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 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 56 [2024-11-19 07:01:42,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:42,931 INFO L225 Difference]: With dead ends: 71 [2024-11-19 07:01:42,931 INFO L226 Difference]: Without dead ends: 71 [2024-11-19 07:01:42,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 07:01:42,932 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:42,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 131 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:01:42,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-19 07:01:42,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-19 07:01:42,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.106060606060606) internal successors, (73), 70 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-19 07:01:42,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2024-11-19 07:01:42,933 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 56 [2024-11-19 07:01:42,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:42,933 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2024-11-19 07:01:42,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 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-19 07:01:42,933 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2024-11-19 07:01:42,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-19 07:01:42,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:42,934 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:42,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 07:01:42,934 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:42,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:42,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1291305125, now seen corresponding path program 1 times [2024-11-19 07:01:42,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:42,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911773321] [2024-11-19 07:01:42,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:42,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:43,018 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 07:01:43,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:43,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911773321] [2024-11-19 07:01:43,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911773321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:01:43,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:01:43,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 07:01:43,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593716914] [2024-11-19 07:01:43,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:01:43,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 07:01:43,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:43,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 07:01:43,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 07:01:43,020 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:43,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:43,087 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2024-11-19 07:01:43,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 07:01:43,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-19 07:01:43,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:43,088 INFO L225 Difference]: With dead ends: 73 [2024-11-19 07:01:43,088 INFO L226 Difference]: Without dead ends: 73 [2024-11-19 07:01:43,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 07:01:43,089 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:43,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 165 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:01:43,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-19 07:01:43,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2024-11-19 07:01:43,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 70 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-19 07:01:43,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2024-11-19 07:01:43,093 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 57 [2024-11-19 07:01:43,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:43,093 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2024-11-19 07:01:43,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:43,093 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2024-11-19 07:01:43,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-19 07:01:43,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:43,094 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:43,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 07:01:43,094 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:43,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:43,094 INFO L85 PathProgramCache]: Analyzing trace with hash 302765524, now seen corresponding path program 1 times [2024-11-19 07:01:43,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:43,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461021454] [2024-11-19 07:01:43,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:43,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:43,214 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 07:01:43,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:43,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461021454] [2024-11-19 07:01:43,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461021454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:01:43,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:01:43,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 07:01:43,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927873480] [2024-11-19 07:01:43,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:01:43,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 07:01:43,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:43,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 07:01:43,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 07:01:43,216 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:43,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:43,294 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2024-11-19 07:01:43,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 07:01:43,295 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-19 07:01:43,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:43,295 INFO L225 Difference]: With dead ends: 72 [2024-11-19 07:01:43,295 INFO L226 Difference]: Without dead ends: 72 [2024-11-19 07:01:43,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 07:01:43,299 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:43,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 153 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:01:43,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-19 07:01:43,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-19 07:01:43,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 71 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-19 07:01:43,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2024-11-19 07:01:43,302 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 59 [2024-11-19 07:01:43,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:43,302 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2024-11-19 07:01:43,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:43,302 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2024-11-19 07:01:43,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-19 07:01:43,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:43,303 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:43,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 07:01:43,303 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:43,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:43,303 INFO L85 PathProgramCache]: Analyzing trace with hash 256575356, now seen corresponding path program 1 times [2024-11-19 07:01:43,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:43,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053774179] [2024-11-19 07:01:43,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:43,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:44,126 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-19 07:01:44,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:44,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053774179] [2024-11-19 07:01:44,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053774179] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:01:44,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015115983] [2024-11-19 07:01:44,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:44,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:44,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:01:44,128 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:01:44,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-19 07:01:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:44,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-19 07:01:44,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:01:44,306 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-19 07:01:44,326 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:01:44,326 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-19 07:01:44,346 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-19 07:01:44,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-19 07:01:44,402 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:01:44,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-19 07:01:44,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:01:44,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:01:44,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:44,534 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 1 case distinctions, treesize of input 40 treesize of output 27 [2024-11-19 07:01:44,635 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:01:44,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-19 07:01:44,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:44,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 32 [2024-11-19 07:01:44,856 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-19 07:01:44,856 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 13 [2024-11-19 07:01:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 07:01:44,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:01:45,013 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2433 (Array Int Int))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2433) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) is different from false [2024-11-19 07:01:45,068 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2433 (Array Int Int))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_2433) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) is different from false [2024-11-19 07:01:45,127 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2433 (Array Int Int)) (v_ArrVal_2432 (Array Int Int))) (or (not (= v_ArrVal_2432 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2432 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2432))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2433)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1))) is different from false [2024-11-19 07:01:45,144 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int) (v_ArrVal_2433 (Array Int Int)) (v_ArrVal_2432 (Array Int Int))) (or (not (= v_ArrVal_2432 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2432 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2432) (select v_ArrVal_2432 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2433) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|))) is different from false [2024-11-19 07:01:45,155 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int) (v_ArrVal_2433 (Array Int Int)) (v_ArrVal_2432 (Array Int Int))) (or (not (= v_ArrVal_2432 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2432 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)))) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base| 0) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2432) (select v_ArrVal_2432 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_2433) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)) 1) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|))) is different from false [2024-11-19 07:01:45,166 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int) (v_ArrVal_2433 (Array Int Int)) (v_ArrVal_2432 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|) (not (= v_ArrVal_2432 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2432 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)))) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base| 0) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2432) (select v_ArrVal_2432 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_2433) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 1))) is different from false [2024-11-19 07:01:45,181 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int) (v_ArrVal_2433 (Array Int Int)) (v_ArrVal_2432 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2432) (select v_ArrVal_2432 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_2433) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) 1) (not (= v_ArrVal_2432 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2432 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)))))) is different from false [2024-11-19 07:01:45,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:45,191 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 51 treesize of output 55 [2024-11-19 07:01:45,220 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int)) (or (forall ((v_ArrVal_2432 (Array Int Int)) (v_ArrVal_2431 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2431))) (or (not (= v_ArrVal_2432 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2432 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)))) (forall ((v_ArrVal_2433 (Array Int Int))) (not (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2432) (select v_ArrVal_2432 .cse1) v_ArrVal_2433) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int)) (or (forall ((v_ArrVal_2432 (Array Int Int)) (v_ArrVal_2431 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2431))) (or (forall ((v_ArrVal_2433 (Array Int Int))) (= (select (select (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2432) (select v_ArrVal_2432 .cse1) v_ArrVal_2433) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= v_ArrVal_2432 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2432 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|))))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|))))) is different from false [2024-11-19 07:01:45,260 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int)) (or (forall ((v_ArrVal_2432 (Array Int Int)) (v_ArrVal_2431 (Array Int Int))) (or (forall ((v_ArrVal_2433 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2431) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2432) (select v_ArrVal_2432 .cse0) v_ArrVal_2433) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= v_ArrVal_2432 (store (select (store .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2431) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2432 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_74| Int)) (or (forall ((v_ArrVal_2432 (Array Int Int)) (v_ArrVal_2431 (Array Int Int))) (or (forall ((v_ArrVal_2433 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2431) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2432) (select v_ArrVal_2432 .cse0) v_ArrVal_2433) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (not (= v_ArrVal_2432 (store (select (store .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2431) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_74| (select v_ArrVal_2432 |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|)))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_74|))))) is different from false [2024-11-19 07:01:45,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:45,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 62 [2024-11-19 07:01:45,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2024-11-19 07:01:45,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:45,279 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 28 treesize of output 32 [2024-11-19 07:01:45,282 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:01:45,283 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:01:45,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:45,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 51 [2024-11-19 07:01:45,292 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 13 treesize of output 11 [2024-11-19 07:01:45,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-19 07:01:45,308 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:01:45,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:45,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 31 [2024-11-19 07:01:45,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:45,330 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 27 treesize of output 35 [2024-11-19 07:01:45,338 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:01:45,342 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-19 07:01:45,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 1 [2024-11-19 07:01:45,418 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 10 not checked. [2024-11-19 07:01:45,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015115983] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:01:45,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:01:45,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 54 [2024-11-19 07:01:45,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187222070] [2024-11-19 07:01:45,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:01:45,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-19 07:01:45,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:01:45,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-19 07:01:45,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1874, Unknown=51, NotChecked=864, Total=2970 [2024-11-19 07:01:45,420 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 55 states, 54 states have (on average 2.814814814814815) internal successors, (152), 55 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:46,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:01:46,441 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2024-11-19 07:01:46,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 07:01:46,441 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.814814814814815) internal successors, (152), 55 states have internal predecessors, (152), 0 states have call successors, (0), 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 62 [2024-11-19 07:01:46,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:01:46,441 INFO L225 Difference]: With dead ends: 81 [2024-11-19 07:01:46,441 INFO L226 Difference]: Without dead ends: 81 [2024-11-19 07:01:46,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 89 SyntacticMatches, 7 SemanticMatches, 69 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=372, Invalid=3389, Unknown=57, NotChecked=1152, Total=4970 [2024-11-19 07:01:46,443 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 58 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 624 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 07:01:46,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 471 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1032 Invalid, 0 Unknown, 624 Unchecked, 0.4s Time] [2024-11-19 07:01:46,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-19 07:01:46,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2024-11-19 07:01:46,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 74 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:46,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2024-11-19 07:01:46,444 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 62 [2024-11-19 07:01:46,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:01:46,445 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2024-11-19 07:01:46,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.814814814814815) internal successors, (152), 55 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:01:46,445 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2024-11-19 07:01:46,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-19 07:01:46,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:01:46,445 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:01:46,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-19 07:01:46,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:46,646 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:01:46,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:01:46,646 INFO L85 PathProgramCache]: Analyzing trace with hash 256575357, now seen corresponding path program 1 times [2024-11-19 07:01:46,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:01:46,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021089181] [2024-11-19 07:01:46,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:46,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:01:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:47,606 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 07:01:47,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:01:47,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021089181] [2024-11-19 07:01:47,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021089181] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:01:47,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036871738] [2024-11-19 07:01:47,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:01:47,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:01:47,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:01:47,608 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:01:47,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-19 07:01:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:01:47,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-11-19 07:01:47,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:01:47,793 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-19 07:01:47,841 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:01:47,841 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-19 07:01:47,867 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-19 07:01:47,871 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-19 07:01:47,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-19 07:01:47,904 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-19 07:01:47,947 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:01:47,947 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 57 treesize of output 50 [2024-11-19 07:01:47,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-19 07:01:48,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:01:48,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 07:01:48,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:01:48,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:01:48,174 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 40 treesize of output 27 [2024-11-19 07:01:48,342 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:01:48,343 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 57 treesize of output 50 [2024-11-19 07:01:48,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-19 07:01:48,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:48,518 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 17 treesize of output 15 [2024-11-19 07:01:48,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:01:48,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 32 [2024-11-19 07:01:48,680 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 07:01:48,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:01:49,196 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_2561 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2561 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_2561)) (forall ((v_ArrVal_2562 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2562))) (or (not (= (store .cse1 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2562 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_2562)) (< (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 0) (forall ((v_ArrVal_2563 (Array Int Int))) (<= 0 (+ (select (select (store .cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2561) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_2563) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))))))) (forall ((v_ArrVal_2561 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2561 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_2561)) (forall ((v_ArrVal_2562 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2562))) (or (not (= (store .cse1 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_2562 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_2562)) (< (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 0) (forall ((v_ArrVal_2564 (Array Int Int)) (v_ArrVal_2563 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2561))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (<= (+ (select (select (store .cse4 .cse5 v_ArrVal_2563) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2564) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))))))))))) is different from false [2024-11-19 07:01:49,249 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_82| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|) (forall ((v_ArrVal_2561 (Array Int Int))) (or (not (= v_ArrVal_2561 (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82| (select v_ArrVal_2561 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|)))) (forall ((v_ArrVal_2562 (Array Int Int))) (or (not (= (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82| (select v_ArrVal_2562 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|)) v_ArrVal_2562)) (< (select v_ArrVal_2562 .cse2) 0) (forall ((v_ArrVal_2564 (Array Int Int)) (v_ArrVal_2563 (Array Int Int))) (let ((.cse3 (select v_ArrVal_2561 .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2562) .cse3 v_ArrVal_2563) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2561) .cse3 v_ArrVal_2564) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))))))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_82| Int) (v_ArrVal_2563 (Array Int Int)) (v_ArrVal_2562 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|) (not (= (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82| (select v_ArrVal_2562 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|)) v_ArrVal_2562)) (< (select v_ArrVal_2562 .cse2) 0) (< 0 (+ 5 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2562) (select .cse0 .cse2) v_ArrVal_2563) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))))) is different from false [2024-11-19 07:01:49,279 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_82| Int) (v_ArrVal_2563 (Array Int Int)) (v_ArrVal_2562 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|) (not (= v_ArrVal_2562 (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82| (select v_ArrVal_2562 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|)))) (< 0 (+ 5 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2562) (select .cse1 .cse2) v_ArrVal_2563) |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (< (select v_ArrVal_2562 .cse2) 0))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_82| Int)) (or (forall ((v_ArrVal_2561 (Array Int Int))) (or (forall ((v_ArrVal_2562 (Array Int Int))) (or (forall ((v_ArrVal_2564 (Array Int Int)) (v_ArrVal_2563 (Array Int Int))) (let ((.cse3 (select v_ArrVal_2561 .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2562) .cse3 v_ArrVal_2563) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2561) .cse3 v_ArrVal_2564) |c_ULTIMATE.start_dll_create_#res#1.base|) 4))))) (not (= v_ArrVal_2562 (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82| (select v_ArrVal_2562 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|)))) (< (select v_ArrVal_2562 .cse2) 0))) (not (= (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82| (select v_ArrVal_2561 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|)) v_ArrVal_2561)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|))))) is different from false [2024-11-19 07:02:14,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:14,375 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 141 treesize of output 145 [2024-11-19 07:02:14,509 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_2559 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_82| Int) (v_ArrVal_2563 (Array Int Int)) (v_ArrVal_2562 (Array Int Int)) (v_ArrVal_2560 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2560))) (or (not (= (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_82| (select v_ArrVal_2562 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|)) v_ArrVal_2562)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|) (< 0 (+ 5 (select (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2562) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2559) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_ArrVal_2563) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (< (select v_ArrVal_2562 .cse1) 0)))) (forall ((v_prenex_12 Int) (v_prenex_14 (Array Int Int)) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_15))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_12) (< (select (select (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_14) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) v_prenex_13) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5)) (not (= v_prenex_14 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_12 (select v_prenex_14 v_prenex_12)))) (< (select v_prenex_14 .cse1) 0)))) (or (forall ((v_prenex_12 Int) (v_ArrVal_2564 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2561 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_11))) (or (= (select (select (store (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2561) (select v_ArrVal_2561 .cse1) v_ArrVal_2564) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_12) (not (= (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_12 (select v_ArrVal_2561 v_prenex_12)) v_ArrVal_2561))))) (forall ((v_prenex_15 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_15) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) 0))))) is different from false [2024-11-19 07:02:14,585 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 0))) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (or (forall ((v_ArrVal_2557 Int) (v_prenex_15 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_2557)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_15) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) 0)) (forall ((v_prenex_12 Int) (v_ArrVal_2564 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_2561 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2561) (select v_ArrVal_2561 .cse2) v_ArrVal_2564) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_12) (not (= (store (select (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_12 (select v_ArrVal_2561 v_prenex_12)) v_ArrVal_2561))))) (forall ((v_ArrVal_2559 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_82| Int) (v_ArrVal_2563 (Array Int Int)) (v_ArrVal_2557 Int) (v_ArrVal_2562 (Array Int Int)) (v_ArrVal_2560 (Array Int Int))) (or (not (= (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_2557)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2560) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_82| (select v_ArrVal_2562 |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|)) v_ArrVal_2562)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_82|) (< 0 (+ 5 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2560) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2562) (select (select (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2559) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) v_ArrVal_2563) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (< (select v_ArrVal_2562 .cse2) 0))) (forall ((v_prenex_12 Int) (v_prenex_14 (Array Int Int)) (v_prenex_13 (Array Int Int)) (v_ArrVal_2557 Int) (v_prenex_11 (Array Int Int)) (v_prenex_15 (Array Int Int))) (or (not (= v_prenex_14 (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_2557)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_15) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_12 (select v_prenex_14 v_prenex_12)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_12) (< (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_15) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_prenex_14) (select (select (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) v_prenex_13) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5)) (< (select v_prenex_14 .cse2) 0)))))) is different from false [2024-11-19 07:02:14,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:14,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 106 [2024-11-19 07:02:14,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:14,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 62 [2024-11-19 07:02:14,621 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 0 case distinctions, treesize of input 90 treesize of output 66 [2024-11-19 07:02:14,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2024-11-19 07:02:14,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 41 treesize of output 37 [2024-11-19 07:02:14,641 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:14,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:14,650 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2024-11-19 07:02:14,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:14,658 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 23 treesize of output 27 [2024-11-19 07:02:14,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-19 07:02:14,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-19 07:02:14,694 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:14,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:14,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 36 [2024-11-19 07:02:14,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:14,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2024-11-19 07:02:14,761 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:14,766 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-19 07:02:14,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 1 [2024-11-19 07:02:14,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:14,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2024-11-19 07:02:14,777 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:14,779 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 20 treesize of output 8 [2024-11-19 07:02:14,784 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:14,789 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-19 07:02:14,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 1 [2024-11-19 07:02:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 7 not checked. [2024-11-19 07:02:14,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036871738] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:02:14,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:02:14,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 21] total 60 [2024-11-19 07:02:14,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924322950] [2024-11-19 07:02:14,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:14,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-11-19 07:02:14,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:14,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-11-19 07:02:14,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2864, Unknown=39, NotChecked=560, Total=3660 [2024-11-19 07:02:14,965 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 61 states, 60 states have (on average 2.7) internal successors, (162), 61 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:02:17,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:17,571 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2024-11-19 07:02:17,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 07:02:17,572 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 2.7) internal successors, (162), 61 states have internal predecessors, (162), 0 states have call successors, (0), 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 62 [2024-11-19 07:02:17,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:17,572 INFO L225 Difference]: With dead ends: 83 [2024-11-19 07:02:17,572 INFO L226 Difference]: Without dead ends: 83 [2024-11-19 07:02:17,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 28.0s TimeCoverageRelationStatistics Valid=417, Invalid=4963, Unknown=42, NotChecked=740, Total=6162 [2024-11-19 07:02:17,574 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 74 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 331 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:17,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 692 Invalid, 1655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1309 Invalid, 0 Unknown, 331 Unchecked, 0.9s Time] [2024-11-19 07:02:17,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-19 07:02:17,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2024-11-19 07:02:17,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 76 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-19 07:02:17,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2024-11-19 07:02:17,575 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 62 [2024-11-19 07:02:17,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:17,576 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2024-11-19 07:02:17,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 2.7) internal successors, (162), 61 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:02:17,576 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2024-11-19 07:02:17,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 07:02:17,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:17,577 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:17,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-19 07:02:17,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:17,778 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:02:17,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:17,778 INFO L85 PathProgramCache]: Analyzing trace with hash -636099946, now seen corresponding path program 1 times [2024-11-19 07:02:17,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:17,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367270413] [2024-11-19 07:02:17,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:17,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:18,476 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 07:02:18,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:18,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367270413] [2024-11-19 07:02:18,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367270413] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:18,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460450353] [2024-11-19 07:02:18,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:18,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:18,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:18,477 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:18,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-19 07:02:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:18,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-19 07:02:18,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:18,701 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-19 07:02:18,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2024-11-19 07:02:18,808 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2024-11-19 07:02:18,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 32 [2024-11-19 07:02:18,875 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-19 07:02:18,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-19 07:02:19,027 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:19,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-19 07:02:19,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:19,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:19,282 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 40 treesize of output 27 [2024-11-19 07:02:19,383 INFO L349 Elim1Store]: treesize reduction 40, result has 43.7 percent of original size [2024-11-19 07:02:19,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 43 [2024-11-19 07:02:19,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:19,924 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 45 treesize of output 67 [2024-11-19 07:02:20,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:20,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 36 [2024-11-19 07:02:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 07:02:20,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:26,170 INFO L349 Elim1Store]: treesize reduction 20, result has 64.3 percent of original size [2024-11-19 07:02:26,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 228 treesize of output 244 [2024-11-19 07:02:26,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:26,205 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 252 treesize of output 248 [2024-11-19 07:02:26,214 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:26,220 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:26,311 INFO L349 Elim1Store]: treesize reduction 112, result has 35.6 percent of original size [2024-11-19 07:02:26,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 265 treesize of output 313 [2024-11-19 07:02:26,495 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 9 treesize of output 1 [2024-11-19 07:02:26,628 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:26,636 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:26,638 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:26,767 INFO L349 Elim1Store]: treesize reduction 151, result has 31.4 percent of original size [2024-11-19 07:02:26,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 1322 treesize of output 1383 [2024-11-19 07:02:27,955 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:27,956 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:27,956 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:27,966 INFO L349 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2024-11-19 07:02:27,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 6 [2024-11-19 07:02:27,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:27,987 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:27,987 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:27,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:27,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 6 [2024-11-19 07:02:28,041 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,042 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:28,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:28,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 6 [2024-11-19 07:02:28,067 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,068 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:28,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:28,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 6 [2024-11-19 07:02:28,109 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,110 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:28,135 INFO L349 Elim1Store]: treesize reduction 37, result has 31.5 percent of original size [2024-11-19 07:02:28,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 49 [2024-11-19 07:02:28,210 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,210 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:28,237 INFO L349 Elim1Store]: treesize reduction 37, result has 31.5 percent of original size [2024-11-19 07:02:28,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 49 [2024-11-19 07:02:28,302 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,303 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:28,306 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,307 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,307 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:28,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:28,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 6 [2024-11-19 07:02:28,319 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,320 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:28,323 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,326 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,326 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:28,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 6 [2024-11-19 07:02:28,341 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,342 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,342 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:28,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 6 [2024-11-19 07:02:28,358 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,359 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,359 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:28,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 6 [2024-11-19 07:02:28,419 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,419 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,473 INFO L349 Elim1Store]: treesize reduction 128, result has 19.0 percent of original size [2024-11-19 07:02:28,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 116 treesize of output 109 [2024-11-19 07:02:28,728 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,729 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:28,795 INFO L349 Elim1Store]: treesize reduction 128, result has 19.0 percent of original size [2024-11-19 07:02:28,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 116 treesize of output 109 [2024-11-19 07:02:29,016 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:29,020 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:29,021 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:29,030 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-19 07:02:29,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 6 [2024-11-19 07:02:29,049 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:29,051 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:29,051 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:29,063 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-19 07:02:29,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 6 [2024-11-19 07:02:29,144 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:29,146 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:29,160 INFO L349 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2024-11-19 07:02:29,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 6 [2024-11-19 07:02:29,928 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:29,930 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:29,953 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-19 07:02:29,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 55 [2024-11-19 07:02:30,060 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,060 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,061 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-19 07:02:30,081 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,082 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-19 07:02:30,108 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,108 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-19 07:02:30,162 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-19 07:02:30,173 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-19 07:02:30,179 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-19 07:02:30,186 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-19 07:02:30,380 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,381 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:30,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 115 [2024-11-19 07:02:30,463 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,465 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:30,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 134 [2024-11-19 07:02:30,626 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,627 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2024-11-19 07:02:30,646 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,647 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2024-11-19 07:02:30,655 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,656 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,656 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,657 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,657 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2024-11-19 07:02:30,674 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,675 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,675 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,676 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2024-11-19 07:02:30,721 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,722 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2024-11-19 07:02:30,767 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,767 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2024-11-19 07:02:30,826 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,827 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2024-11-19 07:02:30,842 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,843 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2024-11-19 07:02:30,916 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,918 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,938 INFO L349 Elim1Store]: treesize reduction 10, result has 63.0 percent of original size [2024-11-19 07:02:30,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 42 [2024-11-19 07:02:31,002 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:31,004 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:31,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2024-11-19 07:02:31,022 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:31,023 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:31,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2024-11-19 07:02:31,038 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:31,039 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:31,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2024-11-19 07:02:31,072 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:31,074 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:31,091 INFO L349 Elim1Store]: treesize reduction 15, result has 44.4 percent of original size [2024-11-19 07:02:31,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 37 [2024-11-19 07:02:31,714 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:31,717 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:31,776 INFO L349 Elim1Store]: treesize reduction 14, result has 77.8 percent of original size [2024-11-19 07:02:31,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 130 treesize of output 162 [2024-11-19 07:02:31,915 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:31,919 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:31,989 INFO L349 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2024-11-19 07:02:31,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 145 treesize of output 183 [2024-11-19 07:02:32,523 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:32,527 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:32,597 INFO L349 Elim1Store]: treesize reduction 10, result has 84.1 percent of original size [2024-11-19 07:02:32,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 106 treesize of output 134 [2024-11-19 07:02:32,718 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:32,720 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:32,741 INFO L349 Elim1Store]: treesize reduction 10, result has 63.0 percent of original size [2024-11-19 07:02:32,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 66 [2024-11-19 07:02:32,843 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:32,844 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:32,844 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:32,845 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:32,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:32,850 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 87 treesize of output 77 [2024-11-19 07:02:32,877 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 67 treesize of output 61 [2024-11-19 07:02:32,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-19 07:02:32,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2024-11-19 07:02:32,921 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:32,921 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:32,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:32,923 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:32,923 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:32,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 89 [2024-11-19 07:02:32,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-19 07:02:33,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-19 07:02:33,048 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:33,049 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:33,050 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:33,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:33,062 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 07:02:33,063 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 97 [2024-11-19 07:02:33,101 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 407 treesize of output 359 [2024-11-19 07:02:33,296 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:33,303 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:33,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:33,316 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 302 treesize of output 280 [2024-11-19 07:02:33,497 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:33,498 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:33,499 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:33,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:33,513 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 07:02:33,514 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 86 treesize of output 79 [2024-11-19 07:02:33,562 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:33,563 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:33,568 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 281 treesize of output 253 [2024-11-19 07:02:33,684 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:33,685 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:33,686 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:33,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:33,693 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 168 treesize of output 148 [2024-11-19 07:02:33,744 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:33,745 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:33,746 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:33,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:33,757 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 07:02:33,757 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 75 treesize of output 68 [2024-11-19 07:02:33,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2024-11-19 07:02:33,817 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:33,817 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:33,818 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:33,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:33,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2024-11-19 07:02:33,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2024-11-19 07:02:33,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-11-19 07:02:33,965 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:33,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:33,999 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 1510 treesize of output 1386 [2024-11-19 07:02:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 16 refuted. 6 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 07:02:35,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460450353] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:02:35,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:02:35,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24, 25] total 63 [2024-11-19 07:02:35,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835167493] [2024-11-19 07:02:35,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:35,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-11-19 07:02:35,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:35,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-11-19 07:02:35,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=3572, Unknown=60, NotChecked=0, Total=3906 [2024-11-19 07:02:35,519 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand has 63 states, 63 states have (on average 2.7142857142857144) internal successors, (171), 63 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:02:37,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:37,843 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2024-11-19 07:02:37,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-19 07:02:37,844 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.7142857142857144) internal successors, (171), 63 states have internal predecessors, (171), 0 states have call successors, (0), 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 63 [2024-11-19 07:02:37,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:37,844 INFO L225 Difference]: With dead ends: 83 [2024-11-19 07:02:37,844 INFO L226 Difference]: Without dead ends: 83 [2024-11-19 07:02:37,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=747, Invalid=6849, Unknown=60, NotChecked=0, Total=7656 [2024-11-19 07:02:37,845 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 201 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:37,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 617 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 07:02:37,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-19 07:02:37,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2024-11-19 07:02:37,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:02:37,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2024-11-19 07:02:37,847 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 63 [2024-11-19 07:02:37,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:37,847 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2024-11-19 07:02:37,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.7142857142857144) internal successors, (171), 63 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:02:37,848 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2024-11-19 07:02:37,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 07:02:37,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:37,848 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:37,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-19 07:02:38,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-19 07:02:38,049 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 07:02:38,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:38,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1405249969, now seen corresponding path program 1 times [2024-11-19 07:02:38,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:38,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030953162] [2024-11-19 07:02:38,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:38,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:39,430 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 07:02:39,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:39,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030953162] [2024-11-19 07:02:39,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030953162] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:39,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990878164] [2024-11-19 07:02:39,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:39,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:39,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:39,432 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:39,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-19 07:02:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:39,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-19 07:02:39,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:39,659 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-19 07:02:39,752 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:02:39,752 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-19 07:02:39,804 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-19 07:02:39,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-19 07:02:39,924 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:39,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-19 07:02:40,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:40,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:40,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:40,195 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 1 case distinctions, treesize of input 40 treesize of output 27 [2024-11-19 07:02:40,403 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:40,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-19 07:02:40,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:40,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 32 [2024-11-19 07:02:40,816 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 07:02:40,816 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:41,121 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2813) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false