./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-2.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 3b4637ab5710a1ca22a981e8047278048fbbf856825d3649b2cb9d48de11d175 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 15:00:16,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 15:00:16,093 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 15:00:16,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 15:00:16,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 15:00:16,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 15:00:16,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 15:00:16,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 15:00:16,121 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 15:00:16,122 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 15:00:16,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 15:00:16,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 15:00:16,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 15:00:16,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 15:00:16,124 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 15:00:16,124 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 15:00:16,125 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 15:00:16,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 15:00:16,125 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 15:00:16,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 15:00:16,126 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 15:00:16,127 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 15:00:16,127 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 15:00:16,127 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 15:00:16,128 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 15:00:16,128 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 15:00:16,128 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 15:00:16,129 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 15:00:16,129 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 15:00:16,129 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 15:00:16,130 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 15:00:16,130 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 15:00:16,130 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 15:00:16,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 15:00:16,131 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 15:00:16,131 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 15:00:16,131 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 15:00:16,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 15:00:16,132 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 15:00:16,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 15:00:16,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 15:00:16,133 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 15:00:16,134 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 -> 3b4637ab5710a1ca22a981e8047278048fbbf856825d3649b2cb9d48de11d175 [2024-11-20 15:00:16,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 15:00:16,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 15:00:16,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 15:00:16,439 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 15:00:16,440 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 15:00:16,441 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i [2024-11-20 15:00:17,862 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 15:00:18,106 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 15:00:18,107 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i [2024-11-20 15:00:18,119 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f76fe9e0/f6b7952c94a94af38cb07666b55c842e/FLAG2bfe1b96e [2024-11-20 15:00:18,448 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f76fe9e0/f6b7952c94a94af38cb07666b55c842e [2024-11-20 15:00:18,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 15:00:18,452 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 15:00:18,454 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 15:00:18,454 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 15:00:18,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 15:00:18,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:00:18" (1/1) ... [2024-11-20 15:00:18,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55aba2c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:18, skipping insertion in model container [2024-11-20 15:00:18,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:00:18" (1/1) ... [2024-11-20 15:00:18,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 15:00:18,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 15:00:18,848 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 15:00:18,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 15:00:18,927 INFO L204 MainTranslator]: Completed translation [2024-11-20 15:00:18,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:18 WrapperNode [2024-11-20 15:00:18,928 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 15:00:18,929 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 15:00:18,929 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 15:00:18,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 15:00:18,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:18" (1/1) ... [2024-11-20 15:00:18,953 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:18" (1/1) ... [2024-11-20 15:00:18,984 INFO L138 Inliner]: procedures = 122, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2024-11-20 15:00:18,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 15:00:18,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 15:00:18,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 15:00:18,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 15:00:18,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:18" (1/1) ... [2024-11-20 15:00:18,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:18" (1/1) ... [2024-11-20 15:00:18,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:18" (1/1) ... [2024-11-20 15:00:19,016 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2024-11-20 15:00:19,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:18" (1/1) ... [2024-11-20 15:00:19,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:18" (1/1) ... [2024-11-20 15:00:19,028 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:18" (1/1) ... [2024-11-20 15:00:19,032 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:18" (1/1) ... [2024-11-20 15:00:19,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:18" (1/1) ... [2024-11-20 15:00:19,036 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:18" (1/1) ... [2024-11-20 15:00:19,039 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 15:00:19,040 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 15:00:19,040 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 15:00:19,041 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 15:00:19,042 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:18" (1/1) ... [2024-11-20 15:00:19,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 15:00:19,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:00:19,094 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-20 15:00:19,098 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-20 15:00:19,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 15:00:19,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 15:00:19,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 15:00:19,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 15:00:19,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 15:00:19,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 15:00:19,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 15:00:19,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 15:00:19,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 15:00:19,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 15:00:19,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 15:00:19,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 15:00:19,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 15:00:19,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 15:00:19,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 15:00:19,296 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 15:00:19,298 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 15:00:19,657 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-20 15:00:19,657 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 15:00:19,673 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 15:00:19,673 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-20 15:00:19,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:00:19 BoogieIcfgContainer [2024-11-20 15:00:19,673 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 15:00:19,677 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 15:00:19,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 15:00:19,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 15:00:19,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:00:18" (1/3) ... [2024-11-20 15:00:19,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0b21a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:00:19, skipping insertion in model container [2024-11-20 15:00:19,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:18" (2/3) ... [2024-11-20 15:00:19,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0b21a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:00:19, skipping insertion in model container [2024-11-20 15:00:19,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:00:19" (3/3) ... [2024-11-20 15:00:19,709 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nullified-2.i [2024-11-20 15:00:19,731 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 15:00:19,732 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2024-11-20 15:00:19,835 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 15:00:19,847 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;@24e343a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 15:00:19,847 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2024-11-20 15:00:19,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 87 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:19,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 15:00:19,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:19,861 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 15:00:19,863 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-20 15:00:19,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:19,871 INFO L85 PathProgramCache]: Analyzing trace with hash 28699851, now seen corresponding path program 1 times [2024-11-20 15:00:19,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:19,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245360156] [2024-11-20 15:00:19,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:19,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:20,110 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-20 15:00:20,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:20,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245360156] [2024-11-20 15:00:20,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245360156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:00:20,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:00:20,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 15:00:20,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597888737] [2024-11-20 15:00:20,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:00:20,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:00:20,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:20,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:00:20,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:00:20,154 INFO L87 Difference]: Start difference. First operand has 88 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 87 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-20 15:00:20,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:20,272 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2024-11-20 15:00:20,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:00:20,277 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-20 15:00:20,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:20,290 INFO L225 Difference]: With dead ends: 82 [2024-11-20 15:00:20,291 INFO L226 Difference]: Without dead ends: 79 [2024-11-20 15:00:20,293 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-20 15:00:20,298 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 10 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:20,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 123 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 15:00:20,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-20 15:00:20,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-20 15:00:20,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 78 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-20 15:00:20,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2024-11-20 15:00:20,330 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 5 [2024-11-20 15:00:20,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:20,331 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2024-11-20 15:00:20,331 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-20 15:00:20,331 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2024-11-20 15:00:20,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 15:00:20,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:20,331 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 15:00:20,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 15:00:20,332 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-20 15:00:20,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:20,333 INFO L85 PathProgramCache]: Analyzing trace with hash 28699852, now seen corresponding path program 1 times [2024-11-20 15:00:20,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:20,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138007314] [2024-11-20 15:00:20,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:20,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:20,448 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-20 15:00:20,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:20,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138007314] [2024-11-20 15:00:20,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138007314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:00:20,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:00:20,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 15:00:20,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874189761] [2024-11-20 15:00:20,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:00:20,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:00:20,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:20,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:00:20,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:00:20,452 INFO L87 Difference]: Start difference. First operand 79 states and 87 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-20 15:00:20,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:20,533 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2024-11-20 15:00:20,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:00:20,536 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-20 15:00:20,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:20,537 INFO L225 Difference]: With dead ends: 74 [2024-11-20 15:00:20,538 INFO L226 Difference]: Without dead ends: 74 [2024-11-20 15:00:20,539 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-20 15:00:20,541 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 10 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:20,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 121 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 15:00:20,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-20 15:00:20,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-20 15:00:20,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 73 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-20 15:00:20,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2024-11-20 15:00:20,552 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 5 [2024-11-20 15:00:20,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:20,553 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2024-11-20 15:00:20,553 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-20 15:00:20,553 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2024-11-20 15:00:20,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 15:00:20,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:20,554 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 15:00:20,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 15:00:20,554 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-20 15:00:20,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:20,555 INFO L85 PathProgramCache]: Analyzing trace with hash 889665583, now seen corresponding path program 1 times [2024-11-20 15:00:20,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:20,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001874395] [2024-11-20 15:00:20,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:20,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:20,612 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-20 15:00:20,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:20,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001874395] [2024-11-20 15:00:20,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001874395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:00:20,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:00:20,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:00:20,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669775012] [2024-11-20 15:00:20,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:00:20,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:00:20,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:20,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:00:20,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:00:20,617 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:20,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:20,647 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2024-11-20 15:00:20,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:00:20,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-20 15:00:20,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:20,649 INFO L225 Difference]: With dead ends: 86 [2024-11-20 15:00:20,649 INFO L226 Difference]: Without dead ends: 86 [2024-11-20 15:00:20,649 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-20 15:00:20,650 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 12 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 157 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-20 15:00:20,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 157 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:00:20,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-20 15:00:20,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2024-11-20 15:00:20,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.66) internal successors, (83), 74 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-20 15:00:20,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2024-11-20 15:00:20,664 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 6 [2024-11-20 15:00:20,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:20,664 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2024-11-20 15:00:20,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:20,665 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2024-11-20 15:00:20,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 15:00:20,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:20,665 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:20,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 15:00:20,666 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-20 15:00:20,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:20,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1228392914, now seen corresponding path program 1 times [2024-11-20 15:00:20,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:20,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226953598] [2024-11-20 15:00:20,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:20,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:20,765 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-20 15:00:20,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:20,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226953598] [2024-11-20 15:00:20,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226953598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:00:20,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:00:20,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:00:20,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830039698] [2024-11-20 15:00:20,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:00:20,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:00:20,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:20,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:00:20,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:00:20,769 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:20,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:20,790 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2024-11-20 15:00:20,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:00:20,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-20 15:00:20,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:20,791 INFO L225 Difference]: With dead ends: 82 [2024-11-20 15:00:20,792 INFO L226 Difference]: Without dead ends: 82 [2024-11-20 15:00:20,792 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-20 15:00:20,793 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 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-20 15:00:20,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:00:20,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-20 15:00:20,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-20 15:00:20,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 81 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-20 15:00:20,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2024-11-20 15:00:20,799 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 11 [2024-11-20 15:00:20,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:20,800 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2024-11-20 15:00:20,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:20,800 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2024-11-20 15:00:20,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-20 15:00:20,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:20,801 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:20,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 15:00:20,801 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-20 15:00:20,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:20,802 INFO L85 PathProgramCache]: Analyzing trace with hash -91353250, now seen corresponding path program 1 times [2024-11-20 15:00:20,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:20,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850396817] [2024-11-20 15:00:20,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:20,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:20,925 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-20 15:00:20,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:20,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850396817] [2024-11-20 15:00:20,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850396817] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:00:20,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236327458] [2024-11-20 15:00:20,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:20,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:20,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:00:20,930 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-20 15:00:20,931 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-20 15:00:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:21,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 15:00:21,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:00:21,114 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-20 15:00:21,114 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:00:21,214 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-20 15:00:21,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236327458] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:00:21,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:00:21,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-20 15:00:21,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664320872] [2024-11-20 15:00:21,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:00:21,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 15:00:21,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:21,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 15:00:21,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-20 15:00:21,216 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:21,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:21,268 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2024-11-20 15:00:21,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 15:00:21,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-20 15:00:21,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:21,271 INFO L225 Difference]: With dead ends: 108 [2024-11-20 15:00:21,271 INFO L226 Difference]: Without dead ends: 108 [2024-11-20 15:00:21,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-20 15:00:21,274 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 28 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:21,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 388 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:00:21,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-20 15:00:21,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2024-11-20 15:00:21,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 79 states have (on average 1.4936708860759493) internal successors, (118), 103 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:21,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2024-11-20 15:00:21,287 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 15 [2024-11-20 15:00:21,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:21,287 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2024-11-20 15:00:21,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:21,287 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2024-11-20 15:00:21,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-20 15:00:21,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:21,288 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:21,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 15:00:21,490 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-20 15:00:21,490 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-20 15:00:21,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:21,491 INFO L85 PathProgramCache]: Analyzing trace with hash 965941251, now seen corresponding path program 1 times [2024-11-20 15:00:21,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:21,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785412797] [2024-11-20 15:00:21,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:21,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:21,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:21,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:21,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785412797] [2024-11-20 15:00:21,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785412797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:00:21,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292306892] [2024-11-20 15:00:21,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:21,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:21,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:00:21,739 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-20 15:00:21,744 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-20 15:00:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:21,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 15:00:21,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:00:21,898 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-20 15:00:21,946 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-20 15:00:21,946 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-20 15:00:21,971 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:21,971 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:00:22,034 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:22,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292306892] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:00:22,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:00:22,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-20 15:00:22,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131430527] [2024-11-20 15:00:22,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:00:22,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 15:00:22,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:22,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 15:00:22,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 15:00:22,037 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:22,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:22,126 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2024-11-20 15:00:22,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 15:00:22,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-20 15:00:22,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:22,128 INFO L225 Difference]: With dead ends: 103 [2024-11-20 15:00:22,128 INFO L226 Difference]: Without dead ends: 103 [2024-11-20 15:00:22,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 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-20 15:00:22,129 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 5 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:22,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 157 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 15:00:22,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-20 15:00:22,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-20 15:00:22,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 102 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-20 15:00:22,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2024-11-20 15:00:22,136 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 20 [2024-11-20 15:00:22,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:22,136 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2024-11-20 15:00:22,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:22,137 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2024-11-20 15:00:22,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-20 15:00:22,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:22,137 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:22,148 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-20 15:00:22,338 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-20 15:00:22,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-20 15:00:22,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:22,339 INFO L85 PathProgramCache]: Analyzing trace with hash 965941252, now seen corresponding path program 1 times [2024-11-20 15:00:22,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:22,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894722949] [2024-11-20 15:00:22,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:22,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:22,632 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:22,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:22,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894722949] [2024-11-20 15:00:22,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894722949] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:00:22,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628751209] [2024-11-20 15:00:22,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:22,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:22,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:00:22,637 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-20 15:00:22,638 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-20 15:00:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:22,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 15:00:22,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:00:22,777 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-20 15:00:22,860 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-20 15:00:22,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-20 15:00:22,952 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:22,953 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:00:23,294 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:23,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628751209] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:00:23,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:00:23,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 10 [2024-11-20 15:00:23,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767530504] [2024-11-20 15:00:23,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:00:23,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 15:00:23,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:23,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 15:00:23,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-20 15:00:23,296 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:23,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:23,494 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2024-11-20 15:00:23,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 15:00:23,494 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-20 15:00:23,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:23,495 INFO L225 Difference]: With dead ends: 102 [2024-11-20 15:00:23,495 INFO L226 Difference]: Without dead ends: 102 [2024-11-20 15:00:23,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-20 15:00:23,496 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 19 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:23,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 290 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 15:00:23,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-20 15:00:23,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-20 15:00:23,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 101 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:23,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2024-11-20 15:00:23,502 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 20 [2024-11-20 15:00:23,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:23,502 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2024-11-20 15:00:23,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:23,502 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2024-11-20 15:00:23,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-20 15:00:23,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:23,503 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:23,512 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-20 15:00:23,707 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-20 15:00:23,708 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-20 15:00:23,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:23,708 INFO L85 PathProgramCache]: Analyzing trace with hash -671675921, now seen corresponding path program 2 times [2024-11-20 15:00:23,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:23,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92210311] [2024-11-20 15:00:23,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:23,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:23,865 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-20 15:00:23,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:23,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92210311] [2024-11-20 15:00:23,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92210311] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:00:23,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36622254] [2024-11-20 15:00:23,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 15:00:23,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:23,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:00:23,872 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-20 15:00:23,880 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-20 15:00:24,039 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 15:00:24,039 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 15:00:24,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 15:00:24,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:00:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:24,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:00:24,244 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:00:24,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36622254] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:00:24,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:00:24,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 9 [2024-11-20 15:00:24,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168568928] [2024-11-20 15:00:24,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:00:24,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 15:00:24,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:24,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 15:00:24,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-20 15:00:24,249 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 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-20 15:00:24,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:24,462 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2024-11-20 15:00:24,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 15:00:24,463 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 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) Word has length 42 [2024-11-20 15:00:24,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:24,463 INFO L225 Difference]: With dead ends: 112 [2024-11-20 15:00:24,463 INFO L226 Difference]: Without dead ends: 112 [2024-11-20 15:00:24,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 74 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2024-11-20 15:00:24,465 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 34 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:24,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 395 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 15:00:24,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-20 15:00:24,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-20 15:00:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 111 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:24,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2024-11-20 15:00:24,470 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 42 [2024-11-20 15:00:24,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:24,470 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2024-11-20 15:00:24,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 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-20 15:00:24,471 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2024-11-20 15:00:24,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-20 15:00:24,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:24,471 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:24,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-20 15:00:24,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:24,672 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-20 15:00:24,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:24,673 INFO L85 PathProgramCache]: Analyzing trace with hash -719682374, now seen corresponding path program 1 times [2024-11-20 15:00:24,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:24,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938102370] [2024-11-20 15:00:24,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:24,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:24,903 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-20 15:00:24,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:24,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938102370] [2024-11-20 15:00:24,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938102370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:00:24,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:00:24,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 15:00:24,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139614772] [2024-11-20 15:00:24,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:00:24,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 15:00:24,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:24,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 15:00:24,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 15:00:24,905 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:25,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:25,064 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2024-11-20 15:00:25,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 15:00:25,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-20 15:00:25,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:25,067 INFO L225 Difference]: With dead ends: 107 [2024-11-20 15:00:25,067 INFO L226 Difference]: Without dead ends: 107 [2024-11-20 15:00:25,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 15:00:25,068 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 47 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:25,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 134 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 15:00:25,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-20 15:00:25,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-20 15:00:25,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 92 states have (on average 1.2717391304347827) internal successors, (117), 106 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-20 15:00:25,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2024-11-20 15:00:25,079 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 55 [2024-11-20 15:00:25,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:25,081 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2024-11-20 15:00:25,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:25,082 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2024-11-20 15:00:25,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-20 15:00:25,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:25,083 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:25,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 15:00:25,084 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-20 15:00:25,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:25,084 INFO L85 PathProgramCache]: Analyzing trace with hash -719682373, now seen corresponding path program 1 times [2024-11-20 15:00:25,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:25,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785106033] [2024-11-20 15:00:25,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:25,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:25,488 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-20 15:00:25,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:25,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785106033] [2024-11-20 15:00:25,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785106033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:00:25,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:00:25,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 15:00:25,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326252890] [2024-11-20 15:00:25,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:00:25,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 15:00:25,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:25,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 15:00:25,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 15:00:25,491 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:25,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:25,663 INFO L93 Difference]: Finished difference Result 137 states and 153 transitions. [2024-11-20 15:00:25,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 15:00:25,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-20 15:00:25,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:25,666 INFO L225 Difference]: With dead ends: 137 [2024-11-20 15:00:25,666 INFO L226 Difference]: Without dead ends: 137 [2024-11-20 15:00:25,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 15:00:25,667 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 43 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:25,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 187 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 15:00:25,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-20 15:00:25,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2024-11-20 15:00:25,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 118 states have (on average 1.271186440677966) internal successors, (150), 132 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:25,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 150 transitions. [2024-11-20 15:00:25,677 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 150 transitions. Word has length 55 [2024-11-20 15:00:25,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:25,678 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 150 transitions. [2024-11-20 15:00:25,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:25,678 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 150 transitions. [2024-11-20 15:00:25,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-20 15:00:25,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:25,683 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:25,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 15:00:25,684 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-20 15:00:25,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:25,684 INFO L85 PathProgramCache]: Analyzing trace with hash 109308755, now seen corresponding path program 1 times [2024-11-20 15:00:25,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:25,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462540306] [2024-11-20 15:00:25,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:25,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-20 15:00:25,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:25,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462540306] [2024-11-20 15:00:25,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462540306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:00:25,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:00:25,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 15:00:25,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575825352] [2024-11-20 15:00:25,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:00:25,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 15:00:25,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:25,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 15:00:25,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 15:00:25,899 INFO L87 Difference]: Start difference. First operand 133 states and 150 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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-20 15:00:26,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:26,021 INFO L93 Difference]: Finished difference Result 139 states and 155 transitions. [2024-11-20 15:00:26,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 15:00:26,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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 59 [2024-11-20 15:00:26,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:26,022 INFO L225 Difference]: With dead ends: 139 [2024-11-20 15:00:26,022 INFO L226 Difference]: Without dead ends: 139 [2024-11-20 15:00:26,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 15:00:26,023 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 44 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:26,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 222 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 15:00:26,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-20 15:00:26,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 133. [2024-11-20 15:00:26,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 118 states have (on average 1.2627118644067796) internal successors, (149), 132 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:26,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 149 transitions. [2024-11-20 15:00:26,034 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 149 transitions. Word has length 59 [2024-11-20 15:00:26,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:26,034 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 149 transitions. [2024-11-20 15:00:26,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 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-20 15:00:26,035 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 149 transitions. [2024-11-20 15:00:26,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 15:00:26,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:26,036 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:26,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 15:00:26,040 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-20 15:00:26,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:26,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1403387200, now seen corresponding path program 1 times [2024-11-20 15:00:26,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:26,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343135005] [2024-11-20 15:00:26,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:26,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 56 proven. 8 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-20 15:00:26,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:26,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343135005] [2024-11-20 15:00:26,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343135005] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:00:26,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513418900] [2024-11-20 15:00:26,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:26,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:26,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:00:26,886 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-20 15:00:26,888 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-20 15:00:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:27,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-20 15:00:27,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:00:27,151 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-20 15:00:27,173 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 15:00:27,174 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-20 15:00:27,181 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-20 15:00:27,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-20 15:00:27,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-20 15:00:27,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:27,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2024-11-20 15:00:27,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:27,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2024-11-20 15:00:27,280 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 18 [2024-11-20 15:00:27,381 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-20 15:00:27,381 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:00:27,402 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1545 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1545) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2024-11-20 15:00:27,429 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (or (not (= (let ((.cse0 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_1544 .cse0))) v_ArrVal_1544)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1545) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0))) is different from false [2024-11-20 15:00:27,456 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (or (not (= (let ((.cse1 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_1544 .cse0))) .cse1 (select v_ArrVal_1544 .cse1))) v_ArrVal_1544)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1545) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0))) is different from false [2024-11-20 15:00:27,472 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (or (not (= (let ((.cse1 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0) .cse0 (select v_ArrVal_1544 .cse0))) .cse1 (select v_ArrVal_1544 .cse1))) v_ArrVal_1544)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1545) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0))) is different from false [2024-11-20 15:00:27,494 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (or (not (= (let ((.cse2 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (store (store (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_1544 .cse0))) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0) .cse1 (select v_ArrVal_1544 .cse1))) .cse2 (select v_ArrVal_1544 .cse2))) v_ArrVal_1544)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1545) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0))) is different from false [2024-11-20 15:00:27,509 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 61 treesize of output 59 [2024-11-20 15:00:27,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-20 15:00:27,579 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 6 not checked. [2024-11-20 15:00:27,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513418900] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:00:27,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:00:27,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 16] total 24 [2024-11-20 15:00:27,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494664756] [2024-11-20 15:00:27,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:00:27,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-20 15:00:27,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:27,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-20 15:00:27,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=300, Unknown=5, NotChecked=190, Total=552 [2024-11-20 15:00:27,582 INFO L87 Difference]: Start difference. First operand 133 states and 149 transitions. Second operand has 24 states, 24 states have (on average 3.25) internal successors, (78), 24 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-20 15:00:28,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:28,059 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2024-11-20 15:00:28,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 15:00:28,059 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.25) internal successors, (78), 24 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-20 15:00:28,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:28,060 INFO L225 Difference]: With dead ends: 137 [2024-11-20 15:00:28,060 INFO L226 Difference]: Without dead ends: 137 [2024-11-20 15:00:28,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 123 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=590, Unknown=5, NotChecked=270, Total=992 [2024-11-20 15:00:28,061 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 56 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 314 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:28,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 845 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 423 Invalid, 0 Unknown, 314 Unchecked, 0.3s Time] [2024-11-20 15:00:28,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-20 15:00:28,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2024-11-20 15:00:28,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 118 states have (on average 1.2542372881355932) internal successors, (148), 132 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:28,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 148 transitions. [2024-11-20 15:00:28,065 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 148 transitions. Word has length 65 [2024-11-20 15:00:28,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:28,065 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 148 transitions. [2024-11-20 15:00:28,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.25) internal successors, (78), 24 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-20 15:00:28,066 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 148 transitions. [2024-11-20 15:00:28,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-20 15:00:28,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:28,068 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:28,080 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-20 15:00:28,268 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,SelfDestructingSolverStorable11 [2024-11-20 15:00:28,268 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-20 15:00:28,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:28,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1899039869, now seen corresponding path program 1 times [2024-11-20 15:00:28,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:28,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737049126] [2024-11-20 15:00:28,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:28,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-20 15:00:28,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:28,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737049126] [2024-11-20 15:00:28,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737049126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:00:28,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:00:28,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:00:28,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267123461] [2024-11-20 15:00:28,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:00:28,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 15:00:28,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:28,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 15:00:28,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 15:00:28,370 INFO L87 Difference]: Start difference. First operand 133 states and 148 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:28,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:28,381 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2024-11-20 15:00:28,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 15:00:28,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-20 15:00:28,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:28,383 INFO L225 Difference]: With dead ends: 135 [2024-11-20 15:00:28,384 INFO L226 Difference]: Without dead ends: 135 [2024-11-20 15:00:28,384 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-20 15:00:28,384 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:28,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 15:00:28,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-20 15:00:28,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2024-11-20 15:00:28,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 119 states have (on average 1.2521008403361344) internal successors, (149), 133 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:28,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 149 transitions. [2024-11-20 15:00:28,389 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 149 transitions. Word has length 67 [2024-11-20 15:00:28,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:28,389 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 149 transitions. [2024-11-20 15:00:28,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:28,389 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 149 transitions. [2024-11-20 15:00:28,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-20 15:00:28,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:28,390 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:28,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 15:00:28,391 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-20 15:00:28,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:28,391 INFO L85 PathProgramCache]: Analyzing trace with hash 7135909, now seen corresponding path program 1 times [2024-11-20 15:00:28,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:28,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710577540] [2024-11-20 15:00:28,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:28,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:28,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 32 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-20 15:00:29,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:29,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710577540] [2024-11-20 15:00:29,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710577540] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:00:29,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249490507] [2024-11-20 15:00:29,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:29,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:29,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:00:29,683 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-20 15:00:29,685 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-20 15:00:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:29,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-20 15:00:29,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:00:29,948 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-20 15:00:29,970 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 15:00:29,971 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-20 15:00:29,991 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-20 15:00:30,016 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-20 15:00:30,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:30,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2024-11-20 15:00:30,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:30,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2024-11-20 15:00:30,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-20 15:00:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-20 15:00:30,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:00:30,310 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2104 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2104) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0)) is different from false [2024-11-20 15:00:30,323 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2104 (Array Int Int)) (v_ArrVal_2103 (Array Int Int))) (or (not (= (let ((.cse0 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_2103 .cse0))) v_ArrVal_2103)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2103) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2104) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0))) is different from false [2024-11-20 15:00:30,344 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2104 (Array Int Int)) (v_ArrVal_2103 (Array Int Int))) (or (not (= v_ArrVal_2103 (let ((.cse1 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_2103 .cse0))) .cse1 (select v_ArrVal_2103 .cse1))))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2103) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2104) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0))) is different from false [2024-11-20 15:00:30,355 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2104 (Array Int Int)) (v_ArrVal_2103 (Array Int Int))) (or (not (= (let ((.cse1 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0) .cse0 (select v_ArrVal_2103 .cse0))) .cse1 (select v_ArrVal_2103 .cse1))) v_ArrVal_2103)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2103) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2104) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0))) is different from false [2024-11-20 15:00:30,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2024-11-20 15:00:30,423 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 5 not checked. [2024-11-20 15:00:30,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249490507] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:00:30,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:00:30,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 16] total 31 [2024-11-20 15:00:30,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415640257] [2024-11-20 15:00:30,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:00:30,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-20 15:00:30,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:30,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-20 15:00:30,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=630, Unknown=4, NotChecked=212, Total=930 [2024-11-20 15:00:30,425 INFO L87 Difference]: Start difference. First operand 134 states and 149 transitions. Second operand has 31 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 31 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-20 15:00:31,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:31,177 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2024-11-20 15:00:31,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 15:00:31,177 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 31 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) Word has length 67 [2024-11-20 15:00:31,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:31,178 INFO L225 Difference]: With dead ends: 139 [2024-11-20 15:00:31,178 INFO L226 Difference]: Without dead ends: 139 [2024-11-20 15:00:31,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=203, Invalid=1291, Unknown=4, NotChecked=308, Total=1806 [2024-11-20 15:00:31,180 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 73 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 247 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:31,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1116 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 698 Invalid, 0 Unknown, 247 Unchecked, 0.4s Time] [2024-11-20 15:00:31,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-20 15:00:31,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 134. [2024-11-20 15:00:31,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 119 states have (on average 1.2436974789915967) internal successors, (148), 133 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:31,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2024-11-20 15:00:31,183 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 67 [2024-11-20 15:00:31,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:31,183 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2024-11-20 15:00:31,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 31 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-20 15:00:31,183 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2024-11-20 15:00:31,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-20 15:00:31,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:31,184 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:31,194 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-20 15:00:31,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:31,389 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-20 15:00:31,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:31,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1259256825, now seen corresponding path program 1 times [2024-11-20 15:00:31,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:31,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821894259] [2024-11-20 15:00:31,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:31,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:32,088 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 56 proven. 8 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-20 15:00:32,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:32,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821894259] [2024-11-20 15:00:32,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821894259] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:00:32,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396844959] [2024-11-20 15:00:32,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:32,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:32,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:00:32,091 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-20 15:00:32,095 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-20 15:00:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:32,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-20 15:00:32,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:00:32,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 15:00:32,493 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 15:00:32,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-20 15:00:32,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-20 15:00:32,582 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-20 15:00:32,610 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 15:00:32,611 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 33 treesize of output 32 [2024-11-20 15:00:32,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:32,755 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 26 treesize of output 20 [2024-11-20 15:00:32,814 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-20 15:00:32,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:00:33,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:33,299 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 28 treesize of output 34 [2024-11-20 15:00:33,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:33,309 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 39 treesize of output 35 [2024-11-20 15:00:33,314 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 22 treesize of output 18 [2024-11-20 15:00:33,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:33,351 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 26 treesize of output 32 [2024-11-20 15:00:33,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:33,364 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 35 treesize of output 33 [2024-11-20 15:00:33,368 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 20 treesize of output 18 [2024-11-20 15:00:33,601 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-20 15:00:33,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396844959] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:00:33,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:00:33,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 32 [2024-11-20 15:00:33,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850329081] [2024-11-20 15:00:33,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:00:33,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-20 15:00:33,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:33,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-20 15:00:33,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=901, Unknown=7, NotChecked=0, Total=992 [2024-11-20 15:00:33,604 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand has 32 states, 32 states have (on average 3.25) internal successors, (104), 32 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:34,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:34,472 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2024-11-20 15:00:34,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 15:00:34,473 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.25) internal successors, (104), 32 states have internal predecessors, (104), 0 states have call successors, (0), 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 68 [2024-11-20 15:00:34,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:34,473 INFO L225 Difference]: With dead ends: 128 [2024-11-20 15:00:34,473 INFO L226 Difference]: Without dead ends: 124 [2024-11-20 15:00:34,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=265, Invalid=1798, Unknown=7, NotChecked=0, Total=2070 [2024-11-20 15:00:34,474 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 63 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:34,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 982 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 15:00:34,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-20 15:00:34,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2024-11-20 15:00:34,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 119 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-20 15:00:34,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2024-11-20 15:00:34,477 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 68 [2024-11-20 15:00:34,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:34,478 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2024-11-20 15:00:34,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.25) internal successors, (104), 32 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:34,478 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2024-11-20 15:00:34,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 15:00:34,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:34,478 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:34,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-20 15:00:34,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:34,683 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-20 15:00:34,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:34,683 INFO L85 PathProgramCache]: Analyzing trace with hash -221625174, now seen corresponding path program 1 times [2024-11-20 15:00:34,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:34,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005135596] [2024-11-20 15:00:34,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:34,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:35,594 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 32 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-20 15:00:35,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:35,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005135596] [2024-11-20 15:00:35,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005135596] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:00:35,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578105455] [2024-11-20 15:00:35,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:35,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:35,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:00:35,597 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-20 15:00:35,598 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-20 15:00:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:35,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-20 15:00:35,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:00:35,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 15:00:35,919 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 15:00:35,919 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-20 15:00:35,963 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-20 15:00:35,987 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-20 15:00:35,998 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-20 15:00:36,007 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 18 treesize of output 13 [2024-11-20 15:00:36,077 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-20 15:00:36,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:00:36,111 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2850 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2850) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0)) is different from false [2024-11-20 15:00:36,122 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2850 (Array Int Int)) (v_ArrVal_2849 (Array Int Int))) (or (= 0 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2849) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2850) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (not (= v_ArrVal_2849 (let ((.cse0 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_2849 .cse0))))))) is different from false [2024-11-20 15:00:36,134 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2850 (Array Int Int)) (v_ArrVal_2849 (Array Int Int))) (or (= 0 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2849) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2850) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (not (= v_ArrVal_2849 (let ((.cse1 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_2849 .cse0))) .cse1 (select v_ArrVal_2849 .cse1))))))) is different from false [2024-11-20 15:00:36,139 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 53 treesize of output 51 [2024-11-20 15:00:36,143 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-20 15:00:36,197 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 4 not checked. [2024-11-20 15:00:36,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578105455] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:00:36,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:00:36,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 24 [2024-11-20 15:00:36,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264828118] [2024-11-20 15:00:36,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:00:36,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-20 15:00:36,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:36,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-20 15:00:36,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=367, Unknown=3, NotChecked=120, Total=552 [2024-11-20 15:00:36,199 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 24 states, 24 states have (on average 4.166666666666667) internal successors, (100), 24 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:36,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:36,604 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2024-11-20 15:00:36,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 15:00:36,604 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.166666666666667) internal successors, (100), 24 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-20 15:00:36,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:36,605 INFO L225 Difference]: With dead ends: 120 [2024-11-20 15:00:36,605 INFO L226 Difference]: Without dead ends: 120 [2024-11-20 15:00:36,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=642, Unknown=3, NotChecked=162, Total=930 [2024-11-20 15:00:36,606 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 16 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:36,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1031 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 490 Invalid, 0 Unknown, 119 Unchecked, 0.3s Time] [2024-11-20 15:00:36,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-20 15:00:36,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-20 15:00:36,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 119 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:36,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2024-11-20 15:00:36,610 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 69 [2024-11-20 15:00:36,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:36,610 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2024-11-20 15:00:36,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.166666666666667) internal successors, (100), 24 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:36,611 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2024-11-20 15:00:36,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 15:00:36,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:36,611 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:36,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-20 15:00:36,812 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,SelfDestructingSolverStorable15 [2024-11-20 15:00:36,812 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-20 15:00:36,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:36,813 INFO L85 PathProgramCache]: Analyzing trace with hash -221625277, now seen corresponding path program 1 times [2024-11-20 15:00:36,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:36,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315363436] [2024-11-20 15:00:36,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:36,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:37,703 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 50 proven. 33 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-20 15:00:37,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:37,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315363436] [2024-11-20 15:00:37,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315363436] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:00:37,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658797960] [2024-11-20 15:00:37,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:37,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:37,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:00:37,707 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-20 15:00:37,709 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-20 15:00:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:38,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-20 15:00:38,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:00:38,018 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-20 15:00:38,038 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 15:00:38,038 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-20 15:00:38,059 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-20 15:00:38,086 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-20 15:00:38,104 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 15:00:38,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-20 15:00:38,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-20 15:00:38,244 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-20 15:00:38,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:00:38,352 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-20 15:00:38,353 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-20 15:00:38,381 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3223 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3223) |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-20 15:00:38,390 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3223 (Array Int Int)) (v_ArrVal_3221 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|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_3221)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3223) |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-20 15:00:38,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:38,399 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-20 15:00:38,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-20 15:00:38,406 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-20 15:00:38,459 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 3 not checked. [2024-11-20 15:00:38,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658797960] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:00:38,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:00:38,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 26 [2024-11-20 15:00:38,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457883590] [2024-11-20 15:00:38,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:00:38,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-20 15:00:38,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:38,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-20 15:00:38,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=537, Unknown=2, NotChecked=94, Total=702 [2024-11-20 15:00:38,462 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 27 states, 26 states have (on average 4.576923076923077) internal successors, (119), 27 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:39,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:39,149 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2024-11-20 15:00:39,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 15:00:39,150 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.576923076923077) internal successors, (119), 27 states have internal predecessors, (119), 0 states have call successors, (0), 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 69 [2024-11-20 15:00:39,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:39,150 INFO L225 Difference]: With dead ends: 122 [2024-11-20 15:00:39,150 INFO L226 Difference]: Without dead ends: 122 [2024-11-20 15:00:39,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=1024, Unknown=2, NotChecked=134, Total=1332 [2024-11-20 15:00:39,151 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 73 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:39,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 523 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 855 Invalid, 0 Unknown, 192 Unchecked, 0.4s Time] [2024-11-20 15:00:39,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-20 15:00:39,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-20 15:00:39,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 107 states have (on average 1.233644859813084) internal successors, (132), 121 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:39,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2024-11-20 15:00:39,154 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 69 [2024-11-20 15:00:39,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:39,155 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2024-11-20 15:00:39,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.576923076923077) internal successors, (119), 27 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:39,155 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2024-11-20 15:00:39,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 15:00:39,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:39,155 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:00:39,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-20 15:00:39,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-20 15:00:39,360 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-20 15:00:39,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:39,360 INFO L85 PathProgramCache]: Analyzing trace with hash -221625276, now seen corresponding path program 1 times [2024-11-20 15:00:39,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:39,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225144070] [2024-11-20 15:00:39,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:39,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:40,601 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-20 15:00:40,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:40,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225144070] [2024-11-20 15:00:40,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225144070] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:00:40,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096212377] [2024-11-20 15:00:40,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:40,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:40,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:00:40,604 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-20 15:00:40,605 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-20 15:00:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:40,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-20 15:00:40,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:00:40,915 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-20 15:00:40,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 15:00:40,980 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 15:00:40,981 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-20 15:00:40,987 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-20 15:00:41,028 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-20 15:00:41,032 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-20 15:00:41,065 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-20 15:00:41,072 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-20 15:00:41,098 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 15:00:41,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-20 15:00:41,105 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-20 15:00:41,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-20 15:00:41,303 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-20 15:00:41,308 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-20 15:00:41,308 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:00:41,515 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_3602 (Array Int Int)) (v_ArrVal_3603 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3603) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3602) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)))) (forall ((v_ArrVal_3603 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3603) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) 4))))) is different from false [2024-11-20 15:00:41,532 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 (+ 12 |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_3601 Int) (v_ArrVal_3603 (Array Int 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_3601)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3603) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) 4))) (forall ((v_ArrVal_3601 Int) (v_ArrVal_3600 Int) (v_ArrVal_3602 (Array Int Int)) (v_ArrVal_3603 (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_3601)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3603) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) 8) (select |c_#length| (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 v_ArrVal_3600)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3602) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)))))) is different from false [2024-11-20 15:00:41,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:41,545 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 55 treesize of output 61 [2024-11-20 15:00:41,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:41,554 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 40 treesize of output 46 [2024-11-20 15:00:41,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2024-11-20 15:00:41,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 78 [2024-11-20 15:00:41,566 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-20 15:00:41,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 11 treesize of output 7 [2024-11-20 15:00:41,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:41,580 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 35 [2024-11-20 15:00:41,583 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:00:41,585 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-20 15:00:41,849 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 3 not checked. [2024-11-20 15:00:41,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096212377] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:00:41,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:00:41,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 31 [2024-11-20 15:00:41,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104574880] [2024-11-20 15:00:41,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:00:41,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-20 15:00:41,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:41,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-20 15:00:41,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=786, Unknown=2, NotChecked=114, Total=992 [2024-11-20 15:00:41,855 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand has 32 states, 31 states have (on average 4.096774193548387) internal successors, (127), 32 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:42,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:42,749 INFO L93 Difference]: Finished difference Result 169 states and 191 transitions. [2024-11-20 15:00:42,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-20 15:00:42,750 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.096774193548387) internal successors, (127), 32 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-20 15:00:42,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:42,751 INFO L225 Difference]: With dead ends: 169 [2024-11-20 15:00:42,751 INFO L226 Difference]: Without dead ends: 169 [2024-11-20 15:00:42,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=1436, Unknown=2, NotChecked=158, Total=1806 [2024-11-20 15:00:42,752 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 100 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 274 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:42,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 747 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 987 Invalid, 0 Unknown, 274 Unchecked, 0.5s Time] [2024-11-20 15:00:42,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-20 15:00:42,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 144. [2024-11-20 15:00:42,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 130 states have (on average 1.2307692307692308) internal successors, (160), 143 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:42,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 160 transitions. [2024-11-20 15:00:42,757 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 160 transitions. Word has length 69 [2024-11-20 15:00:42,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:42,757 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 160 transitions. [2024-11-20 15:00:42,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.096774193548387) internal successors, (127), 32 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:42,758 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 160 transitions. [2024-11-20 15:00:42,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-20 15:00:42,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:42,758 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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-20 15:00:42,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-20 15:00:42,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-20 15:00:42,959 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-20 15:00:42,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:42,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1069989468, now seen corresponding path program 1 times [2024-11-20 15:00:42,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:42,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676157911] [2024-11-20 15:00:42,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:42,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:43,214 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-20 15:00:43,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:43,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676157911] [2024-11-20 15:00:43,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676157911] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:00:43,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078046408] [2024-11-20 15:00:43,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:43,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:43,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:00:43,217 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-20 15:00:43,219 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-20 15:00:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:43,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-20 15:00:43,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:00:43,567 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-20 15:00:43,581 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-20 15:00:43,601 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-20 15:00:43,625 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-20 15:00:43,641 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-20 15:00:43,676 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 15:00:43,677 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-20 15:00:43,682 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-11-20 15:00:43,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:00:43,799 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-11-20 15:00:43,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078046408] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:00:43,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:00:43,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 5 [2024-11-20 15:00:43,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090477499] [2024-11-20 15:00:43,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:00:43,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 15:00:43,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:00:43,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 15:00:43,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 15:00:43,801 INFO L87 Difference]: Start difference. First operand 144 states and 160 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:43,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:00:43,860 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2024-11-20 15:00:43,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 15:00:43,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 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 73 [2024-11-20 15:00:43,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:00:43,861 INFO L225 Difference]: With dead ends: 144 [2024-11-20 15:00:43,861 INFO L226 Difference]: Without dead ends: 144 [2024-11-20 15:00:43,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 144 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-20 15:00:43,862 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 79 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 15:00:43,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 48 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 15:00:43,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-20 15:00:43,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-20 15:00:43,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 130 states have (on average 1.2153846153846153) internal successors, (158), 143 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:43,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 158 transitions. [2024-11-20 15:00:43,866 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 158 transitions. Word has length 73 [2024-11-20 15:00:43,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:00:43,866 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 158 transitions. [2024-11-20 15:00:43,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:00:43,867 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2024-11-20 15:00:43,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-20 15:00:43,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:00:43,867 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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-20 15:00:43,877 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-20 15:00:44,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:44,071 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-20 15:00:44,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:00:44,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1302944375, now seen corresponding path program 1 times [2024-11-20 15:00:44,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:00:44,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929206922] [2024-11-20 15:00:44,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:44,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:00:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:45,865 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 67 proven. 37 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 15:00:45,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:00:45,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929206922] [2024-11-20 15:00:45,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929206922] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:00:45,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031361181] [2024-11-20 15:00:45,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:00:45,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:00:45,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:00:45,869 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-20 15:00:45,871 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-20 15:00:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:00:46,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-20 15:00:46,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:00:46,233 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-20 15:00:46,261 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-20 15:00:46,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-20 15:00:46,307 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-20 15:00:46,348 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-20 15:00:46,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-20 15:00:46,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-20 15:00:46,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-20 15:00:46,459 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 16 [2024-11-20 15:00:46,571 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-20 15:00:46,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-20 15:00:46,648 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 16 [2024-11-20 15:00:46,659 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 16 [2024-11-20 15:00:46,672 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 16 [2024-11-20 15:00:46,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 15:00:46,694 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 16 [2024-11-20 15:00:46,705 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-20 15:00:46,762 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 16 [2024-11-20 15:00:46,774 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-20 15:00:46,780 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-20 15:00:46,817 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 15:00:46,818 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 114 treesize of output 101 [2024-11-20 15:00:46,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 15:00:46,841 INFO L349 Elim1Store]: treesize reduction 33, result has 36.5 percent of original size [2024-11-20 15:00:46,842 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 64 treesize of output 39 [2024-11-20 15:00:46,851 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-20 15:00:47,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 44 [2024-11-20 15:00:47,290 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 39 treesize of output 21 [2024-11-20 15:00:47,388 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 73 proven. 25 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-20 15:00:47,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:00:47,628 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4367 (Array Int Int)) (v_ArrVal_4368 (Array Int Int)) (v_ArrVal_4369 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4368) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) (or (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4369) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4367) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) .cse1) 0) (< .cse1 0) (not (= v_ArrVal_4369 (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2 (select v_ArrVal_4369 .cse2))))))))) is different from false [2024-11-20 15:00:47,662 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4367 (Array Int Int)) (v_ArrVal_4368 (Array Int Int)) (v_ArrVal_4369 (Array Int Int)) (v_ArrVal_4365 Int) (v_ArrVal_4363 Int)) (let ((.cse2 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4362)) (.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 v_ArrVal_4363)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4368) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (or (not (= v_ArrVal_4369 (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1 (select v_ArrVal_4369 .cse1))))) (= (select (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4369) (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|) .cse2 v_ArrVal_4365)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4367) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3)) .cse4) 0) (< .cse4 0))))) is different from false [2024-11-20 15:00:47,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:47,678 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 67 [2024-11-20 15:00:47,684 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 104 treesize of output 92 [2024-11-20 15:00:47,691 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 45 treesize of output 41 [2024-11-20 15:00:47,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:00:47,699 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 103 treesize of output 78 [2024-11-20 15:00:47,704 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 120 treesize of output 96 [2024-11-20 15:00:47,708 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 35 treesize of output 27 [2024-11-20 15:00:47,840 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (let ((.cse3 (forall ((v_ArrVal_4362 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_4369 (Array Int Int)) (v_arrayElimCell_98 Int)) (or (< v_arrayElimCell_100 0) (not (= (store v_ArrVal_4362 .cse1 (select v_ArrVal_4369 .cse1)) v_ArrVal_4369)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4362) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4369) v_arrayElimCell_98) v_arrayElimCell_100) 0)))) (.cse2 (not .cse4))) (and (forall ((v_arrayElimCell_99 Int)) (or (forall ((v_arrayElimCell_100 Int)) (or (forall ((v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4369 (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4362))) (or (not (= v_ArrVal_4369 (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1 (select v_ArrVal_4369 .cse1)))) (= (select (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4369) v_arrayElimCell_98) v_arrayElimCell_100) 0) (= (select v_ArrVal_4369 v_arrayElimCell_99) 0)))) (< v_arrayElimCell_100 0))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_99) (< v_arrayElimCell_99 0))) (or .cse2 (and .cse3 (forall ((v_arrayElimCell_99 Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_99) (forall ((v_arrayElimCell_100 Int)) (or (forall ((v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4369 (Array Int Int)) (v_arrayElimCell_98 Int)) (or (not (= (store v_ArrVal_4362 .cse1 (select v_ArrVal_4369 .cse1)) v_ArrVal_4369)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4362) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4369) v_arrayElimCell_98) v_arrayElimCell_100) 0) (= (select v_ArrVal_4369 v_arrayElimCell_99) 0))) (< v_arrayElimCell_100 0))))))) (or .cse4 (forall ((v_arrayElimCell_99 Int)) (or (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) v_arrayElimCell_99) 0) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_99) (< v_arrayElimCell_99 0)))) (or .cse3 (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) .cse2)))) is different from false [2024-11-20 15:00:47,937 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (let ((.cse3 (forall ((v_ArrVal_4362 (Array Int Int)) (v_arrayElimCell_100 Int) (v_ArrVal_4369 (Array Int Int)) (v_arrayElimCell_98 Int)) (or (< v_arrayElimCell_100 0) (not (= (store v_ArrVal_4362 .cse1 (select v_ArrVal_4369 .cse1)) v_ArrVal_4369)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4362) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4369) v_arrayElimCell_98) v_arrayElimCell_100) 0)))) (.cse2 (not .cse4))) (and (forall ((v_arrayElimCell_99 Int)) (or (forall ((v_arrayElimCell_100 Int)) (or (forall ((v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4369 (Array Int Int)) (v_arrayElimCell_98 Int)) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4362))) (or (not (= v_ArrVal_4369 (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1 (select v_ArrVal_4369 .cse1)))) (= (select (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4369) v_arrayElimCell_98) v_arrayElimCell_100) 0) (= (select v_ArrVal_4369 v_arrayElimCell_99) 0)))) (< v_arrayElimCell_100 0))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_99) (< v_arrayElimCell_99 0))) (or .cse2 (and .cse3 (forall ((v_arrayElimCell_99 Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_99) (forall ((v_arrayElimCell_100 Int)) (or (forall ((v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4369 (Array Int Int)) (v_arrayElimCell_98 Int)) (or (not (= (store v_ArrVal_4362 .cse1 (select v_ArrVal_4369 .cse1)) v_ArrVal_4369)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4362) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4369) v_arrayElimCell_98) v_arrayElimCell_100) 0) (= (select v_ArrVal_4369 v_arrayElimCell_99) 0))) (< v_arrayElimCell_100 0))))))) (or .cse4 (forall ((v_ArrVal_4357 (Array Int Int)) (v_arrayElimCell_99 Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_99) (< v_arrayElimCell_99 0) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4357) |c_ULTIMATE.start_dll_create_~head~0#1.base|) v_arrayElimCell_99) 0)))) (or .cse3 (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) .cse2)))) is different from false [2024-11-20 15:00:48,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-20 15:00:48,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-20 15:00:48,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-20 15:01:14,614 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 52 treesize of output 48 [2024-11-20 15:01:14,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2024-11-20 15:01:14,623 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 22 treesize of output 20 [2024-11-20 15:01:14,654 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:14,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:01:14,677 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 1043 treesize of output 1033 [2024-11-20 15:01:14,717 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2024-11-20 15:01:14,718 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 106 [2024-11-20 15:01:14,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2024-11-20 15:01:14,906 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:14,907 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:14,908 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:14,954 INFO L349 Elim1Store]: treesize reduction 16, result has 57.9 percent of original size [2024-11-20 15:01:14,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 22 [2024-11-20 15:01:14,982 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:14,983 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:14,984 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:15,023 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2024-11-20 15:01:15,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 1 [2024-11-20 15:01:15,037 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:15,038 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:15,039 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:15,040 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:15,040 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:15,041 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:15,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:01:15,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 15 [2024-11-20 15:01:15,098 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:15,151 INFO L349 Elim1Store]: treesize reduction 57, result has 20.8 percent of original size [2024-11-20 15:01:15,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 15 [2024-11-20 15:01:15,274 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:15,377 INFO L349 Elim1Store]: treesize reduction 263, result has 29.7 percent of original size [2024-11-20 15:01:15,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 188 treesize of output 250 [2024-11-20 15:01:15,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:01:15,406 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 79 treesize of output 83 [2024-11-20 15:01:15,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:01:15,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 55 [2024-11-20 15:01:16,245 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,247 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,248 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,249 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,251 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,266 INFO L349 Elim1Store]: treesize reduction 29, result has 25.6 percent of original size [2024-11-20 15:01:16,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 58 [2024-11-20 15:01:16,312 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,314 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,315 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,315 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,319 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,337 INFO L349 Elim1Store]: treesize reduction 29, result has 25.6 percent of original size [2024-11-20 15:01:16,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 58 [2024-11-20 15:01:16,381 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,383 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,384 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,385 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,388 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,404 INFO L349 Elim1Store]: treesize reduction 29, result has 25.6 percent of original size [2024-11-20 15:01:16,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 58 [2024-11-20 15:01:16,433 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,435 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,452 INFO L349 Elim1Store]: treesize reduction 21, result has 32.3 percent of original size [2024-11-20 15:01:16,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 58 [2024-11-20 15:01:16,502 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,504 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,520 INFO L349 Elim1Store]: treesize reduction 27, result has 12.9 percent of original size [2024-11-20 15:01:16,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 52 [2024-11-20 15:01:16,559 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,560 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,561 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,563 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,564 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,566 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,586 INFO L349 Elim1Store]: treesize reduction 19, result has 34.5 percent of original size [2024-11-20 15:01:16,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 58 [2024-11-20 15:01:16,651 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,652 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,652 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,655 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,655 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,658 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,678 INFO L349 Elim1Store]: treesize reduction 19, result has 34.5 percent of original size [2024-11-20 15:01:16,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 58 [2024-11-20 15:01:16,755 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,756 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,759 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,760 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,762 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,796 INFO L349 Elim1Store]: treesize reduction 28, result has 50.9 percent of original size [2024-11-20 15:01:16,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 88 [2024-11-20 15:01:16,875 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,877 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,882 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,882 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,883 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,884 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,890 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-20 15:01:16,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 48 [2024-11-20 15:01:16,918 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,919 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,921 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,922 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,923 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,924 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:16,936 INFO L349 Elim1Store]: treesize reduction 19, result has 34.5 percent of original size [2024-11-20 15:01:16,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 58 [2024-11-20 15:01:16,979 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:17,019 INFO L349 Elim1Store]: treesize reduction 68, result has 29.9 percent of original size [2024-11-20 15:01:17,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 95 treesize of output 99 [2024-11-20 15:01:17,468 INFO L349 Elim1Store]: treesize reduction 10, result has 77.8 percent of original size [2024-11-20 15:01:17,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 130 treesize of output 138 [2024-11-20 15:01:17,610 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 52 treesize of output 48 [2024-11-20 15:01:17,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-20 15:01:17,623 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:17,624 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 51 treesize of output 45 [2024-11-20 15:01:17,645 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:17,648 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 61 treesize of output 59 [2024-11-20 15:01:17,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-20 15:01:17,667 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:17,668 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:17,669 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:17,669 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:17,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 19 treesize of output 17 [2024-11-20 15:01:18,065 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 65 proven. 9 refuted. 8 times theorem prover too weak. 11 trivial. 16 not checked. [2024-11-20 15:01:18,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031361181] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:01:18,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:01:18,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 24] total 54 [2024-11-20 15:01:18,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150183462] [2024-11-20 15:01:18,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:01:18,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-20 15:01:18,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:18,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-20 15:01:18,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2218, Unknown=45, NotChecked=396, Total=2862 [2024-11-20 15:01:18,069 INFO L87 Difference]: Start difference. First operand 144 states and 158 transitions. Second operand has 54 states, 54 states have (on average 3.1666666666666665) internal successors, (171), 54 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-20 15:01:21,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:21,263 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2024-11-20 15:01:21,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-20 15:01:21,264 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 3.1666666666666665) internal successors, (171), 54 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 79 [2024-11-20 15:01:21,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:21,264 INFO L225 Difference]: With dead ends: 152 [2024-11-20 15:01:21,264 INFO L226 Difference]: Without dead ends: 152 [2024-11-20 15:01:21,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 28.5s TimeCoverageRelationStatistics Valid=776, Invalid=4895, Unknown=45, NotChecked=604, Total=6320 [2024-11-20 15:01:21,266 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 128 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 1560 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 374 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 15:01:21,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1512 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1560 Invalid, 0 Unknown, 374 Unchecked, 1.3s Time] [2024-11-20 15:01:21,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-20 15:01:21,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 144. [2024-11-20 15:01:21,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 130 states have (on average 1.2076923076923076) internal successors, (157), 143 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:21,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2024-11-20 15:01:21,270 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 79 [2024-11-20 15:01:21,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:21,270 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2024-11-20 15:01:21,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 3.1666666666666665) internal successors, (171), 54 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-20 15:01:21,271 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2024-11-20 15:01:21,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-20 15:01:21,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:21,271 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2024-11-20 15:01:21,282 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-20 15:01:21,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:01:21,472 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-20 15:01:21,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:21,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1972673710, now seen corresponding path program 1 times [2024-11-20 15:01:21,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:21,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818090471] [2024-11-20 15:01:21,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:21,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 65 proven. 41 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 15:01:23,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:23,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818090471] [2024-11-20 15:01:23,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818090471] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:01:23,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188304562] [2024-11-20 15:01:23,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:23,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:01:23,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:01:23,516 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-20 15:01:23,517 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-20 15:01:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:23,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-20 15:01:23,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:01:23,849 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-20 15:01:23,872 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-20 15:01:23,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-20 15:01:23,917 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-20 15:01:23,961 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-20 15:01:24,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-20 15:01:24,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-20 15:01:24,040 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 16 [2024-11-20 15:01:24,167 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-20 15:01:24,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-20 15:01:24,224 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 16 [2024-11-20 15:01:24,237 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 16 [2024-11-20 15:01:24,286 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 16 [2024-11-20 15:01:24,299 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-20 15:01:24,305 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 16 [2024-11-20 15:01:24,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 15:01:24,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-20 15:01:24,375 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-20 15:01:24,382 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 16 [2024-11-20 15:01:24,426 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 15:01:24,427 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 114 treesize of output 101 [2024-11-20 15:01:24,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 15:01:24,450 INFO L349 Elim1Store]: treesize reduction 33, result has 36.5 percent of original size [2024-11-20 15:01:24,451 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 64 treesize of output 39 [2024-11-20 15:01:24,456 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-20 15:01:24,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 44 [2024-11-20 15:01:24,855 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 39 treesize of output 21 [2024-11-20 15:01:25,045 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 71 proven. 29 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-20 15:01:25,045 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 15:01:25,353 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4760 (Array Int Int)) (v_ArrVal_4758 (Array Int Int)) (v_ArrVal_4759 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4760) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (or (not (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0 (select v_ArrVal_4758 .cse0))) v_ArrVal_4758)) (< .cse1 0) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4758) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4759) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) (+ .cse1 8)) 0))))) is different from false [2024-11-20 15:01:25,382 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4760 (Array Int Int)) (v_ArrVal_4755 Int) (v_ArrVal_4753 Int) (v_ArrVal_4757 (Array Int Int)) (v_ArrVal_4758 (Array Int Int)) (v_ArrVal_4759 (Array Int Int))) (let ((.cse2 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 v_ArrVal_4753)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4760) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3)) (.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4757))) (or (< .cse0 0) (= (select (select (store .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4758) (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|) .cse2 v_ArrVal_4755)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4759) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3)) (+ .cse0 8)) 0) (not (= v_ArrVal_4758 (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (store (select .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse4 (select v_ArrVal_4758 .cse4))))))))) is different from false [2024-11-20 15:01:25,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:01:25,402 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 63 treesize of output 69 [2024-11-20 15:01:25,408 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 108 treesize of output 96 [2024-11-20 15:01:25,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2024-11-20 15:01:25,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:01:25,422 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 107 treesize of output 82 [2024-11-20 15:01:25,427 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 128 treesize of output 104 [2024-11-20 15:01:25,431 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 37 treesize of output 29 [2024-11-20 15:01:25,589 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12)) (.cse4 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse3 (not .cse4)) (.cse2 (forall ((v_arrayElimCell_219 Int) (v_ArrVal_4757 (Array Int Int)) (v_ArrVal_4758 (Array Int Int)) (v_arrayElimCell_217 Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4757) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4758) v_arrayElimCell_217) (+ v_arrayElimCell_219 8)) 0) (not (= (store v_ArrVal_4757 .cse1 (select v_ArrVal_4758 .cse1)) v_ArrVal_4758)) (< v_arrayElimCell_219 0))))) (and (forall ((v_arrayElimCell_218 Int)) (or (< v_arrayElimCell_218 0) (forall ((v_arrayElimCell_219 Int)) (or (< v_arrayElimCell_219 0) (forall ((v_ArrVal_4757 (Array Int Int)) (v_ArrVal_4758 (Array Int Int)) (v_arrayElimCell_217 Int)) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4757))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4758) v_arrayElimCell_217) (+ v_arrayElimCell_219 8)) 0) (= (select v_ArrVal_4758 (+ v_arrayElimCell_218 8)) 0) (not (= v_ArrVal_4758 (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1 (select v_ArrVal_4758 .cse1))))))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_218))) (or (and .cse2 (forall ((v_arrayElimCell_218 Int)) (or (forall ((v_arrayElimCell_219 Int)) (or (forall ((v_ArrVal_4757 (Array Int Int)) (v_ArrVal_4758 (Array Int Int)) (v_arrayElimCell_217 Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4757) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4758) v_arrayElimCell_217) (+ v_arrayElimCell_219 8)) 0) (= (select v_ArrVal_4758 (+ v_arrayElimCell_218 8)) 0) (not (= (store v_ArrVal_4757 .cse1 (select v_ArrVal_4758 .cse1)) v_ArrVal_4758)))) (< v_arrayElimCell_219 0))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_218)))) .cse3) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) .cse3 .cse2) (or .cse4 (forall ((v_arrayElimCell_218 Int)) (or (< v_arrayElimCell_218 0) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_218) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ v_arrayElimCell_218 8)) 0))))))) is different from false [2024-11-20 15:01:25,690 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12)) (.cse4 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse3 (not .cse4)) (.cse2 (forall ((v_arrayElimCell_219 Int) (v_ArrVal_4757 (Array Int Int)) (v_ArrVal_4758 (Array Int Int)) (v_arrayElimCell_217 Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4757) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4758) v_arrayElimCell_217) (+ v_arrayElimCell_219 8)) 0) (not (= (store v_ArrVal_4757 .cse1 (select v_ArrVal_4758 .cse1)) v_ArrVal_4758)) (< v_arrayElimCell_219 0))))) (and (forall ((v_arrayElimCell_218 Int)) (or (< v_arrayElimCell_218 0) (forall ((v_arrayElimCell_219 Int)) (or (< v_arrayElimCell_219 0) (forall ((v_ArrVal_4757 (Array Int Int)) (v_ArrVal_4758 (Array Int Int)) (v_arrayElimCell_217 Int)) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4757))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4758) v_arrayElimCell_217) (+ v_arrayElimCell_219 8)) 0) (= (select v_ArrVal_4758 (+ v_arrayElimCell_218 8)) 0) (not (= v_ArrVal_4758 (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1 (select v_ArrVal_4758 .cse1))))))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_218))) (or (and .cse2 (forall ((v_arrayElimCell_218 Int)) (or (forall ((v_arrayElimCell_219 Int)) (or (forall ((v_ArrVal_4757 (Array Int Int)) (v_ArrVal_4758 (Array Int Int)) (v_arrayElimCell_217 Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4757) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4758) v_arrayElimCell_217) (+ v_arrayElimCell_219 8)) 0) (= (select v_ArrVal_4758 (+ v_arrayElimCell_218 8)) 0) (not (= (store v_ArrVal_4757 .cse1 (select v_ArrVal_4758 .cse1)) v_ArrVal_4758)))) (< v_arrayElimCell_219 0))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_218)))) .cse3) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) .cse3 .cse2) (or (forall ((v_ArrVal_4748 (Array Int Int)) (v_arrayElimCell_218 Int)) (or (< v_arrayElimCell_218 0) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4748) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ v_arrayElimCell_218 8)) 0) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_arrayElimCell_218))) .cse4)))) is different from false [2024-11-20 15:01:25,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-20 15:01:25,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-20 15:01:25,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-20 15:01:28,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2024-11-20 15:01:28,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:01:28,157 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 61 treesize of output 57 [2024-11-20 15:01:28,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-20 15:01:28,189 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:28,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:01:28,209 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 1164 treesize of output 1154 [2024-11-20 15:01:28,250 INFO L349 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2024-11-20 15:01:28,250 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 114 [2024-11-20 15:01:28,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2024-11-20 15:01:28,348 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:28,349 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:28,380 INFO L349 Elim1Store]: treesize reduction 18, result has 57.1 percent of original size [2024-11-20 15:01:28,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 24 [2024-11-20 15:01:28,400 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:28,402 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:28,424 INFO L349 Elim1Store]: treesize reduction 57, result has 1.7 percent of original size [2024-11-20 15:01:28,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 1 [2024-11-20 15:01:28,433 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:28,434 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:28,434 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:28,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:01:28,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 17 [2024-11-20 15:01:28,607 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:28,814 INFO L349 Elim1Store]: treesize reduction 378, result has 26.7 percent of original size [2024-11-20 15:01:28,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 187 treesize of output 304 [2024-11-20 15:01:29,015 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:29,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 15:01:29,049 INFO L349 Elim1Store]: treesize reduction 71, result has 12.3 percent of original size [2024-11-20 15:01:29,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 105 treesize of output 50 [2024-11-20 15:01:29,075 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:29,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 15:01:29,106 INFO L349 Elim1Store]: treesize reduction 71, result has 12.3 percent of original size [2024-11-20 15:01:29,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 105 treesize of output 50 [2024-11-20 15:01:29,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:01:29,206 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 104 treesize of output 94 [2024-11-20 15:01:29,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:01:29,333 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 100 treesize of output 90 [2024-11-20 15:01:29,753 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:29,792 INFO L349 Elim1Store]: treesize reduction 8, result has 86.0 percent of original size [2024-11-20 15:01:29,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 114 [2024-11-20 15:01:30,006 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:30,043 INFO L349 Elim1Store]: treesize reduction 8, result has 86.0 percent of original size [2024-11-20 15:01:30,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 114 [2024-11-20 15:01:30,468 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:30,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 15:01:30,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 37 [2024-11-20 15:01:30,500 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:30,502 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 58 treesize of output 56 [2024-11-20 15:01:30,510 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:30,511 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 15:01:30,513 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 55 treesize of output 51 [2024-11-20 15:01:30,516 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-20 15:01:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 65 proven. 13 refuted. 6 times theorem prover too weak. 11 trivial. 16 not checked. [2024-11-20 15:01:30,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188304562] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 15:01:30,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 15:01:30,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 25] total 55 [2024-11-20 15:01:30,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108741198] [2024-11-20 15:01:30,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 15:01:30,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-20 15:01:30,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:01:30,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-20 15:01:30,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2323, Unknown=30, NotChecked=404, Total=2970 [2024-11-20 15:01:30,845 INFO L87 Difference]: Start difference. First operand 144 states and 157 transitions. Second operand has 55 states, 55 states have (on average 3.1454545454545455) internal successors, (173), 55 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:33,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:01:33,726 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2024-11-20 15:01:33,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-20 15:01:33,727 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 3.1454545454545455) internal successors, (173), 55 states have internal predecessors, (173), 0 states have call successors, (0), 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 81 [2024-11-20 15:01:33,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:01:33,727 INFO L225 Difference]: With dead ends: 152 [2024-11-20 15:01:33,728 INFO L226 Difference]: Without dead ends: 152 [2024-11-20 15:01:33,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 139 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=690, Invalid=4846, Unknown=30, NotChecked=596, Total=6162 [2024-11-20 15:01:33,729 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 48 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 1697 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 2102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 370 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 15:01:33,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 1503 Invalid, 2102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1697 Invalid, 0 Unknown, 370 Unchecked, 1.3s Time] [2024-11-20 15:01:33,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-20 15:01:33,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 144. [2024-11-20 15:01:33,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 130 states have (on average 1.2) internal successors, (156), 143 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:33,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2024-11-20 15:01:33,732 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 81 [2024-11-20 15:01:33,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:01:33,733 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2024-11-20 15:01:33,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 3.1454545454545455) internal successors, (173), 55 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 15:01:33,733 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2024-11-20 15:01:33,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-20 15:01:33,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:01:33,734 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:01:33,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-20 15:01:33,934 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,SelfDestructingSolverStorable20 [2024-11-20 15:01:33,935 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-20 15:01:33,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:01:33,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2061386512, now seen corresponding path program 1 times [2024-11-20 15:01:33,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:01:33,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217841935] [2024-11-20 15:01:33,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:33,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:01:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 15:01:35,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:01:35,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217841935] [2024-11-20 15:01:35,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217841935] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:01:35,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651743049] [2024-11-20 15:01:35,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:01:35,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:01:35,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:01:35,393 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-20 15:01:35,394 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-20 15:01:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:01:35,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-20 15:01:35,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:01:35,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 15:01:35,848 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-20 15:01:35,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-20 15:01:35,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-20 15:01:35,955 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-20 15:01:35,988 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 15:01:35,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2024-11-20 15:01:36,091 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-20 15:01:36,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-20 15:01:36,150 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 33 treesize of output 24 [2024-11-20 15:01:36,164 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 33 treesize of output 24 [2024-11-20 15:01:36,177 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 33 treesize of output 24 [2024-11-20 15:01:36,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2024-11-20 15:01:36,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1