./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-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-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:49:51,384 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:49:51,481 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:49:51,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:49:51,489 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:49:51,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:49:51,518 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:49:51,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:49:51,519 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:49:51,520 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:49:51,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:49:51,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:49:51,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:49:51,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:49:51,525 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:49:51,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:49:51,525 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:49:51,525 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:49:51,526 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:49:51,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:49:51,526 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:49:51,527 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:49:51,528 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:49:51,528 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:49:51,528 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:49:51,529 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:49:51,529 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:49:51,529 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:49:51,529 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:49:51,530 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:49:51,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:49:51,530 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:49:51,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:49:51,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:49:51,531 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:49:51,532 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:49:51,532 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:49:51,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:49:51,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:49:51,533 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:49:51,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:49:51,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:49:51,534 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-17 00:49:51,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:49:51,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:49:51,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:49:51,801 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:49:51,802 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:49:51,803 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i [2024-11-17 00:49:53,304 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:49:53,547 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:49:53,549 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i [2024-11-17 00:49:53,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6203cc6c/27fcfe9d21b444e29329d19eeadfaf0a/FLAGe1457883c [2024-11-17 00:49:53,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6203cc6c/27fcfe9d21b444e29329d19eeadfaf0a [2024-11-17 00:49:53,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:49:53,586 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:49:53,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:49:53,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:49:53,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:49:53,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:49:53" (1/1) ... [2024-11-17 00:49:53,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@587c2d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:53, skipping insertion in model container [2024-11-17 00:49:53,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:49:53" (1/1) ... [2024-11-17 00:49:53,641 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:49:53,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:49:54,008 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:49:54,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:49:54,086 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:49:54,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:54 WrapperNode [2024-11-17 00:49:54,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:49:54,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:49:54,088 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:49:54,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:49:54,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:54" (1/1) ... [2024-11-17 00:49:54,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:54" (1/1) ... [2024-11-17 00:49:54,141 INFO L138 Inliner]: procedures = 122, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 111 [2024-11-17 00:49:54,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:49:54,144 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:49:54,144 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:49:54,144 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:49:54,154 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:54" (1/1) ... [2024-11-17 00:49:54,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:54" (1/1) ... [2024-11-17 00:49:54,160 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:54" (1/1) ... [2024-11-17 00:49:54,189 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-17 00:49:54,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:54" (1/1) ... [2024-11-17 00:49:54,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:54" (1/1) ... [2024-11-17 00:49:54,200 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:54" (1/1) ... [2024-11-17 00:49:54,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:54" (1/1) ... [2024-11-17 00:49:54,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:54" (1/1) ... [2024-11-17 00:49:54,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:54" (1/1) ... [2024-11-17 00:49:54,215 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:49:54,216 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:49:54,216 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:49:54,216 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:49:54,217 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:54" (1/1) ... [2024-11-17 00:49:54,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:49:54,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:49:54,246 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-17 00:49:54,249 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-17 00:49:54,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 00:49:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 00:49:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 00:49:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 00:49:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:49:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:49:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:49:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:49:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:49:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:49:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:49:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:49:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 00:49:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:49:54,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:49:54,400 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:49:54,402 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:49:54,703 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: assume true;havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2024-11-17 00:49:54,725 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-17 00:49:54,725 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:49:54,737 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:49:54,737 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:49:54,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:49:54 BoogieIcfgContainer [2024-11-17 00:49:54,738 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:49:54,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:49:54,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:49:54,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:49:54,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:49:53" (1/3) ... [2024-11-17 00:49:54,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb9a79c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:49:54, skipping insertion in model container [2024-11-17 00:49:54,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:54" (2/3) ... [2024-11-17 00:49:54,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb9a79c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:49:54, skipping insertion in model container [2024-11-17 00:49:54,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:49:54" (3/3) ... [2024-11-17 00:49:54,745 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nullified-2.i [2024-11-17 00:49:54,760 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:49:54,761 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2024-11-17 00:49:54,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:49:54,810 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;@6732395, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:49:54,810 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2024-11-17 00:49:54,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 58 states have (on average 1.8620689655172413) internal successors, (108), 93 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:49:54,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:49:54,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:54,822 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:49:54,823 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2024-11-17 00:49:54,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:54,829 INFO L85 PathProgramCache]: Analyzing trace with hash -6383175, now seen corresponding path program 1 times [2024-11-17 00:49:54,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:54,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566980433] [2024-11-17 00:49:54,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:54,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:55,085 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-17 00:49:55,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:55,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566980433] [2024-11-17 00:49:55,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566980433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:49:55,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:49:55,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:49:55,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069785199] [2024-11-17 00:49:55,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:49:55,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:49:55,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:55,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:49:55,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:49:55,125 INFO L87 Difference]: Start difference. First operand has 94 states, 58 states have (on average 1.8620689655172413) internal successors, (108), 93 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:49:55,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:55,296 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2024-11-17 00:49:55,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:49:55,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-17 00:49:55,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:55,307 INFO L225 Difference]: With dead ends: 88 [2024-11-17 00:49:55,307 INFO L226 Difference]: Without dead ends: 84 [2024-11-17 00:49:55,309 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-17 00:49:55,312 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 10 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:55,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 133 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:49:55,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-17 00:49:55,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-17 00:49:55,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.7037037037037037) internal successors, (92), 83 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:49:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2024-11-17 00:49:55,348 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 6 [2024-11-17 00:49:55,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:55,349 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2024-11-17 00:49:55,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:49:55,349 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2024-11-17 00:49:55,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:49:55,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:55,349 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:49:55,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:49:55,350 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2024-11-17 00:49:55,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:55,351 INFO L85 PathProgramCache]: Analyzing trace with hash -6383174, now seen corresponding path program 1 times [2024-11-17 00:49:55,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:55,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689383462] [2024-11-17 00:49:55,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:55,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:55,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:55,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:55,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689383462] [2024-11-17 00:49:55,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689383462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:49:55,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:49:55,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:49:55,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905275387] [2024-11-17 00:49:55,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:49:55,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:49:55,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:55,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:49:55,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:49:55,494 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:49:55,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:55,569 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2024-11-17 00:49:55,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:49:55,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-17 00:49:55,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:55,571 INFO L225 Difference]: With dead ends: 79 [2024-11-17 00:49:55,572 INFO L226 Difference]: Without dead ends: 79 [2024-11-17 00:49:55,572 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-17 00:49:55,574 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 10 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 131 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-17 00:49:55,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 131 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:49:55,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-17 00:49:55,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-17 00:49:55,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.6111111111111112) 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-17 00:49:55,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2024-11-17 00:49:55,587 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 6 [2024-11-17 00:49:55,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:55,588 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2024-11-17 00:49:55,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:49:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2024-11-17 00:49:55,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:49:55,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:55,589 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:55,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:49:55,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2024-11-17 00:49:55,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:55,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1841904167, now seen corresponding path program 1 times [2024-11-17 00:49:55,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:55,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783840213] [2024-11-17 00:49:55,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:55,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:55,673 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-17 00:49:55,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:55,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783840213] [2024-11-17 00:49:55,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783840213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:49:55,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:49:55,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:49:55,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054613765] [2024-11-17 00:49:55,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:49:55,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:49:55,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:55,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:49:55,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:49:55,677 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:49:55,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:55,698 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2024-11-17 00:49:55,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:49:55,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-17 00:49:55,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:55,700 INFO L225 Difference]: With dead ends: 92 [2024-11-17 00:49:55,700 INFO L226 Difference]: Without dead ends: 92 [2024-11-17 00:49:55,701 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-17 00:49:55,702 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 12 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:55,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 167 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:49:55,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-17 00:49:55,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2024-11-17 00:49:55,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.5892857142857142) internal successors, (89), 80 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:49:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2024-11-17 00:49:55,720 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 8 [2024-11-17 00:49:55,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:55,720 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2024-11-17 00:49:55,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:49:55,721 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2024-11-17 00:49:55,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 00:49:55,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:55,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:55,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:49:55,722 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2024-11-17 00:49:55,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:55,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1696606160, now seen corresponding path program 1 times [2024-11-17 00:49:55,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:55,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026447968] [2024-11-17 00:49:55,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:55,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:55,872 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-17 00:49:55,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:55,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026447968] [2024-11-17 00:49:55,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026447968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:49:55,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:49:55,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:49:55,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485556777] [2024-11-17 00:49:55,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:49:55,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:49:55,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:55,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:49:55,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:49:55,876 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:49:55,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:55,902 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2024-11-17 00:49:55,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:49:55,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-11-17 00:49:55,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:55,904 INFO L225 Difference]: With dead ends: 88 [2024-11-17 00:49:55,904 INFO L226 Difference]: Without dead ends: 88 [2024-11-17 00:49:55,905 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-17 00:49:55,906 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:55,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:49:55,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-17 00:49:55,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-17 00:49:55,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 63 states have (on average 1.5238095238095237) internal successors, (96), 87 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:49:55,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2024-11-17 00:49:55,922 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 12 [2024-11-17 00:49:55,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:55,922 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2024-11-17 00:49:55,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:49:55,923 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2024-11-17 00:49:55,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 00:49:55,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:55,924 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:55,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:49:55,926 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2024-11-17 00:49:55,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:55,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1474136506, now seen corresponding path program 1 times [2024-11-17 00:49:55,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:55,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175155402] [2024-11-17 00:49:55,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:55,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:56,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:56,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:56,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175155402] [2024-11-17 00:49:56,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175155402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:49:56,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751221253] [2024-11-17 00:49:56,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:56,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:49:56,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:49:56,075 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-17 00:49:56,076 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-17 00:49:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:56,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:49:56,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:49:56,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:56,251 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:49:56,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:56,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751221253] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:49:56,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:49:56,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-17 00:49:56,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059621300] [2024-11-17 00:49:56,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:49:56,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:49:56,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:56,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:49:56,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:49:56,305 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:49:56,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:56,340 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2024-11-17 00:49:56,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:49:56,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-17 00:49:56,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:56,342 INFO L225 Difference]: With dead ends: 117 [2024-11-17 00:49:56,342 INFO L226 Difference]: Without dead ends: 117 [2024-11-17 00:49:56,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 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-17 00:49:56,343 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 36 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:56,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 204 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:49:56,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-17 00:49:56,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2024-11-17 00:49:56,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 112 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-17 00:49:56,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2024-11-17 00:49:56,356 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 18 [2024-11-17 00:49:56,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:56,357 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2024-11-17 00:49:56,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:49:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2024-11-17 00:49:56,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 00:49:56,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:56,358 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:56,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-17 00:49:56,558 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-17 00:49:56,559 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2024-11-17 00:49:56,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:56,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2037615133, now seen corresponding path program 1 times [2024-11-17 00:49:56,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:56,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523679625] [2024-11-17 00:49:56,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:56,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:56,777 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:56,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:56,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523679625] [2024-11-17 00:49:56,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523679625] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:49:56,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441449302] [2024-11-17 00:49:56,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:56,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:49:56,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:49:56,781 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-17 00:49:56,783 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-17 00:49:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:56,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 00:49:56,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:49:56,964 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-17 00:49:57,026 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 00:49:57,027 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-17 00:49:57,066 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:57,066 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:49:57,130 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:57,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441449302] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:49:57,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:49:57,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-17 00:49:57,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950487588] [2024-11-17 00:49:57,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:49:57,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:49:57,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:57,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:49:57,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:49:57,132 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:49:57,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:57,245 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2024-11-17 00:49:57,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:49:57,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-17 00:49:57,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:57,247 INFO L225 Difference]: With dead ends: 112 [2024-11-17 00:49:57,247 INFO L226 Difference]: Without dead ends: 112 [2024-11-17 00:49:57,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 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-17 00:49:57,248 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:57,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 219 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:49:57,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-17 00:49:57,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-17 00:49:57,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 88 states have (on average 1.4090909090909092) internal successors, (124), 111 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:49:57,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2024-11-17 00:49:57,254 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 22 [2024-11-17 00:49:57,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:57,255 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2024-11-17 00:49:57,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:49:57,255 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2024-11-17 00:49:57,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 00:49:57,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:57,256 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:57,274 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-17 00:49:57,459 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-17 00:49:57,460 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2024-11-17 00:49:57,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:57,461 INFO L85 PathProgramCache]: Analyzing trace with hash 2037615134, now seen corresponding path program 1 times [2024-11-17 00:49:57,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:57,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965736682] [2024-11-17 00:49:57,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:57,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:57,720 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:57,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:57,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965736682] [2024-11-17 00:49:57,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965736682] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:49:57,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305940823] [2024-11-17 00:49:57,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:57,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:49:57,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:49:57,724 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-17 00:49:57,725 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-17 00:49:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:57,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 00:49:57,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:49:57,871 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-17 00:49:57,968 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:49:57,969 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-17 00:49:58,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:58,066 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:49:58,392 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:58,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305940823] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:49:58,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:49:58,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 12 [2024-11-17 00:49:58,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165877554] [2024-11-17 00:49:58,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:49:58,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 00:49:58,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:58,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 00:49:58,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:49:58,394 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:49:58,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:58,603 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2024-11-17 00:49:58,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:49:58,604 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-17 00:49:58,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:58,605 INFO L225 Difference]: With dead ends: 111 [2024-11-17 00:49:58,605 INFO L226 Difference]: Without dead ends: 111 [2024-11-17 00:49:58,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:49:58,606 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 17 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:58,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 428 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:49:58,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-17 00:49:58,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-17 00:49:58,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 88 states have (on average 1.375) internal successors, (121), 110 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:49:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2024-11-17 00:49:58,618 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 22 [2024-11-17 00:49:58,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:58,619 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2024-11-17 00:49:58,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:49:58,619 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2024-11-17 00:49:58,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-17 00:49:58,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:58,620 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:58,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-17 00:49:58,821 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-17 00:49:58,821 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2024-11-17 00:49:58,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:58,822 INFO L85 PathProgramCache]: Analyzing trace with hash -967086579, now seen corresponding path program 2 times [2024-11-17 00:49:58,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:58,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272000750] [2024-11-17 00:49:58,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:58,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:58,942 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-17 00:49:58,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:58,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272000750] [2024-11-17 00:49:58,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272000750] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:49:58,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488713720] [2024-11-17 00:49:58,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:49:58,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:49:58,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:49:58,947 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-17 00:49:58,953 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-17 00:49:59,124 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:49:59,124 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:49:59,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 00:49:59,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:49:59,242 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:59,242 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:49:59,338 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:59,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488713720] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:49:59,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:49:59,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 9 [2024-11-17 00:49:59,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981758194] [2024-11-17 00:49:59,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:49:59,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:49:59,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:59,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:49:59,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:49:59,345 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:49:59,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:59,576 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2024-11-17 00:49:59,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-17 00:49:59,576 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-17 00:49:59,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:59,577 INFO L225 Difference]: With dead ends: 122 [2024-11-17 00:49:59,577 INFO L226 Difference]: Without dead ends: 122 [2024-11-17 00:49:59,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 90 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-17 00:49:59,578 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 30 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:59,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 498 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:49:59,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-17 00:49:59,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-17 00:49:59,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.303030303030303) internal successors, (129), 121 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-17 00:49:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2024-11-17 00:49:59,583 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 48 [2024-11-17 00:49:59,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:59,584 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2024-11-17 00:49:59,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:49:59,584 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2024-11-17 00:49:59,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-17 00:49:59,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:59,585 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:59,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-17 00:49:59,789 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-17 00:49:59,790 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2024-11-17 00:49:59,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:59,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1047673082, now seen corresponding path program 1 times [2024-11-17 00:49:59,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:59,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98867965] [2024-11-17 00:49:59,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:59,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:00,069 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-17 00:50:00,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:50:00,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98867965] [2024-11-17 00:50:00,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98867965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:50:00,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:50:00,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:50:00,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178176349] [2024-11-17 00:50:00,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:50:00,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:50:00,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:50:00,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:50:00,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:50:00,071 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:00,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:50:00,227 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2024-11-17 00:50:00,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:50:00,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-17 00:50:00,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:50:00,230 INFO L225 Difference]: With dead ends: 119 [2024-11-17 00:50:00,230 INFO L226 Difference]: Without dead ends: 119 [2024-11-17 00:50:00,230 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-17 00:50:00,230 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 49 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:50:00,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 158 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:50:00,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-17 00:50:00,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-17 00:50:00,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 104 states have (on average 1.2403846153846154) internal successors, (129), 118 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-17 00:50:00,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2024-11-17 00:50:00,241 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 62 [2024-11-17 00:50:00,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:50:00,241 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2024-11-17 00:50:00,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:00,241 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2024-11-17 00:50:00,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-17 00:50:00,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:50:00,243 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:50:00,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 00:50:00,243 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2024-11-17 00:50:00,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:50:00,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1047673081, now seen corresponding path program 1 times [2024-11-17 00:50:00,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:50:00,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495482506] [2024-11-17 00:50:00,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:50:00,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:50:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:00,646 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-17 00:50:00,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:50:00,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495482506] [2024-11-17 00:50:00,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495482506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:50:00,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:50:00,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:50:00,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285517146] [2024-11-17 00:50:00,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:50:00,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:50:00,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:50:00,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:50:00,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:50:00,649 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:00,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:50:00,807 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2024-11-17 00:50:00,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:50:00,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-17 00:50:00,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:50:00,809 INFO L225 Difference]: With dead ends: 150 [2024-11-17 00:50:00,809 INFO L226 Difference]: Without dead ends: 150 [2024-11-17 00:50:00,809 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-17 00:50:00,810 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 44 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:50:00,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 215 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:50:00,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-17 00:50:00,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2024-11-17 00:50:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 131 states have (on average 1.2442748091603053) internal successors, (163), 145 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:00,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 163 transitions. [2024-11-17 00:50:00,814 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 163 transitions. Word has length 62 [2024-11-17 00:50:00,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:50:00,815 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 163 transitions. [2024-11-17 00:50:00,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:00,815 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 163 transitions. [2024-11-17 00:50:00,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-17 00:50:00,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:50:00,817 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:50:00,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 00:50:00,817 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2024-11-17 00:50:00,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:50:00,818 INFO L85 PathProgramCache]: Analyzing trace with hash 567608042, now seen corresponding path program 1 times [2024-11-17 00:50:00,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:50:00,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694849375] [2024-11-17 00:50:00,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:50:00,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:50:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:01,007 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-17 00:50:01,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:50:01,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694849375] [2024-11-17 00:50:01,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694849375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:50:01,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:50:01,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:50:01,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609053077] [2024-11-17 00:50:01,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:50:01,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:50:01,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:50:01,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:50:01,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:50:01,009 INFO L87 Difference]: Start difference. First operand 146 states and 163 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 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-17 00:50:01,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:50:01,123 INFO L93 Difference]: Finished difference Result 153 states and 169 transitions. [2024-11-17 00:50:01,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:50:01,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 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 68 [2024-11-17 00:50:01,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:50:01,125 INFO L225 Difference]: With dead ends: 153 [2024-11-17 00:50:01,125 INFO L226 Difference]: Without dead ends: 153 [2024-11-17 00:50:01,125 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-17 00:50:01,126 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 45 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:50:01,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 246 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:50:01,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-17 00:50:01,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 146. [2024-11-17 00:50:01,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 131 states have (on average 1.2366412213740459) internal successors, (162), 145 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:01,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 162 transitions. [2024-11-17 00:50:01,130 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 162 transitions. Word has length 68 [2024-11-17 00:50:01,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:50:01,130 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 162 transitions. [2024-11-17 00:50:01,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 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-17 00:50:01,131 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 162 transitions. [2024-11-17 00:50:01,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-17 00:50:01,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:50:01,133 INFO L215 NwaCegarLoop]: trace histogram [6, 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] [2024-11-17 00:50:01,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:50:01,133 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2024-11-17 00:50:01,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:50:01,134 INFO L85 PathProgramCache]: Analyzing trace with hash -357160240, now seen corresponding path program 1 times [2024-11-17 00:50:01,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:50:01,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630580777] [2024-11-17 00:50:01,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:50:01,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:50:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 64 proven. 9 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-17 00:50:01,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:50:01,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630580777] [2024-11-17 00:50:01,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630580777] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:50:01,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839930750] [2024-11-17 00:50:01,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:50:01,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:50:01,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:50:01,929 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-17 00:50:01,931 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-17 00:50:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:02,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-17 00:50:02,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:50:02,193 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-17 00:50:02,218 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:50:02,219 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-17 00:50:02,227 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-17 00:50:02,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 27 treesize of output 11 [2024-11-17 00:50:02,253 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-17 00:50:02,265 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-17 00:50:02,274 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-17 00:50:02,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:50:02,309 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 68 proven. 11 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-17 00:50:02,309 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:50:02,332 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1546 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1546) |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-17 00:50:02,354 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1545 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1545) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1546) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0) (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_1545 .cse0))) v_ArrVal_1545)))) is different from false [2024-11-17 00:50:02,366 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1545 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1545) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1546) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0) (not (= v_ArrVal_1545 (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_1545 .cse0))) .cse1 (select v_ArrVal_1545 .cse1))))))) is different from false [2024-11-17 00:50:02,379 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1545 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1545) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1546) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0) (not (= v_ArrVal_1545 (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 (let ((.cse0 (+ 16 |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_1545 .cse0))) .cse1 (select v_ArrVal_1545 .cse1))) .cse2 (select v_ArrVal_1545 .cse2))))))) is different from false [2024-11-17 00:50:02,395 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1545 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1545) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1546) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0) (not (= v_ArrVal_1545 (let ((.cse3 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (store (let ((.cse1 (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (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_1545 .cse0))) .cse1 (select v_ArrVal_1545 .cse1))) .cse2 (select v_ArrVal_1545 .cse2))) .cse3 (select v_ArrVal_1545 .cse3))))))) is different from false [2024-11-17 00:50:02,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 65 treesize of output 63 [2024-11-17 00:50:02,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-17 00:50:02,456 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 68 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 6 not checked. [2024-11-17 00:50:02,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839930750] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:50:02,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:50:02,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 16] total 19 [2024-11-17 00:50:02,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240069267] [2024-11-17 00:50:02,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:50:02,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-17 00:50:02,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:50:02,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-17 00:50:02,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=158, Unknown=5, NotChecked=140, Total=342 [2024-11-17 00:50:02,458 INFO L87 Difference]: Start difference. First operand 146 states and 162 transitions. Second operand has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:02,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:50:02,831 INFO L93 Difference]: Finished difference Result 150 states and 164 transitions. [2024-11-17 00:50:02,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:50:02,832 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-17 00:50:02,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:50:02,833 INFO L225 Difference]: With dead ends: 150 [2024-11-17 00:50:02,833 INFO L226 Difference]: Without dead ends: 150 [2024-11-17 00:50:02,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 142 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=316, Unknown=5, NotChecked=200, Total=600 [2024-11-17 00:50:02,834 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 55 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 329 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:50:02,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 814 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 333 Invalid, 0 Unknown, 329 Unchecked, 0.2s Time] [2024-11-17 00:50:02,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-17 00:50:02,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2024-11-17 00:50:02,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 131 states have (on average 1.2290076335877862) internal successors, (161), 145 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:02,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 161 transitions. [2024-11-17 00:50:02,839 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 161 transitions. Word has length 72 [2024-11-17 00:50:02,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:50:02,839 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 161 transitions. [2024-11-17 00:50:02,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:02,840 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2024-11-17 00:50:02,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-17 00:50:02,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:50:02,843 INFO L215 NwaCegarLoop]: trace histogram [6, 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-17 00:50:02,862 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-17 00:50:03,043 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-17 00:50:03,044 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2024-11-17 00:50:03,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:50:03,044 INFO L85 PathProgramCache]: Analyzing trace with hash 687702704, now seen corresponding path program 1 times [2024-11-17 00:50:03,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:50:03,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968429731] [2024-11-17 00:50:03,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:50:03,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:50:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:04,216 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 58 proven. 33 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-17 00:50:04,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:50:04,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968429731] [2024-11-17 00:50:04,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968429731] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:50:04,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597213023] [2024-11-17 00:50:04,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:50:04,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:50:04,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:50:04,219 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-17 00:50:04,220 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-17 00:50:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:04,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-17 00:50:04,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:50:04,479 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-17 00:50:04,502 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:50:04,502 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-17 00:50:04,522 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-17 00:50:04,546 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-17 00:50:04,554 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-17 00:50:04,562 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-17 00:50:04,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-17 00:50:04,648 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 68 proven. 11 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-17 00:50:04,648 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:50:05,412 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1923 (Array Int Int)) (v_ArrVal_1922 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1922) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1923) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0) (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_1922 .cse0))) v_ArrVal_1922)))) is different from false [2024-11-17 00:50:05,424 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1923 (Array Int Int)) (v_ArrVal_1922 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1922) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1923) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0) (not (= v_ArrVal_1922 (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_1922 .cse0))) .cse1 (select v_ArrVal_1922 .cse1))))))) is different from false [2024-11-17 00:50:05,436 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1923 (Array Int Int)) (v_ArrVal_1922 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1922) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1923) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0) (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 (let ((.cse0 (+ 16 |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_1922 .cse0))) .cse1 (select v_ArrVal_1922 .cse1))) .cse2 (select v_ArrVal_1922 .cse2))) v_ArrVal_1922)))) is different from false [2024-11-17 00:50:05,442 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 60 [2024-11-17 00:50:05,500 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 68 proven. 8 refuted. 0 times theorem prover too weak. 37 trivial. 3 not checked. [2024-11-17 00:50:05,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597213023] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:50:05,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:50:05,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 16] total 26 [2024-11-17 00:50:05,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843759971] [2024-11-17 00:50:05,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:50:05,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 00:50:05,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:50:05,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 00:50:05,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=440, Unknown=10, NotChecked=132, Total=650 [2024-11-17 00:50:05,503 INFO L87 Difference]: Start difference. First operand 146 states and 161 transitions. Second operand has 26 states, 26 states have (on average 3.923076923076923) internal successors, (102), 26 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-17 00:50:05,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:50:05,967 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2024-11-17 00:50:05,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 00:50:05,967 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.923076923076923) internal successors, (102), 26 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) Word has length 74 [2024-11-17 00:50:05,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:50:05,968 INFO L225 Difference]: With dead ends: 150 [2024-11-17 00:50:05,968 INFO L226 Difference]: Without dead ends: 150 [2024-11-17 00:50:05,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 142 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=135, Invalid=797, Unknown=10, NotChecked=180, Total=1122 [2024-11-17 00:50:05,969 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 82 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:50:05,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 834 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 446 Invalid, 0 Unknown, 195 Unchecked, 0.3s Time] [2024-11-17 00:50:05,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-17 00:50:05,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2024-11-17 00:50:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 131 states have (on average 1.2213740458015268) internal successors, (160), 145 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-17 00:50:05,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 160 transitions. [2024-11-17 00:50:05,973 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 160 transitions. Word has length 74 [2024-11-17 00:50:05,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:50:05,973 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 160 transitions. [2024-11-17 00:50:05,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.923076923076923) internal successors, (102), 26 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-17 00:50:05,974 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 160 transitions. [2024-11-17 00:50:05,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-17 00:50:05,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:50:05,975 INFO L215 NwaCegarLoop]: trace histogram [6, 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-17 00:50:05,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-17 00:50:06,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:50:06,177 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2024-11-17 00:50:06,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:50:06,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1504039285, now seen corresponding path program 1 times [2024-11-17 00:50:06,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:50:06,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096129978] [2024-11-17 00:50:06,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:50:06,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:50:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:06,267 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-17 00:50:06,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:50:06,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096129978] [2024-11-17 00:50:06,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096129978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:50:06,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:50:06,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:50:06,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366457125] [2024-11-17 00:50:06,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:50:06,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:50:06,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:50:06,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:50:06,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:50:06,269 INFO L87 Difference]: Start difference. First operand 146 states and 160 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:06,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:50:06,276 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2024-11-17 00:50:06,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:50:06,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-17 00:50:06,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:50:06,278 INFO L225 Difference]: With dead ends: 148 [2024-11-17 00:50:06,279 INFO L226 Difference]: Without dead ends: 148 [2024-11-17 00:50:06,279 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-17 00:50:06,280 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 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-17 00:50:06,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:50:06,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-17 00:50:06,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2024-11-17 00:50:06,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 132 states have (on average 1.2196969696969697) internal successors, (161), 146 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:06,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2024-11-17 00:50:06,285 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 75 [2024-11-17 00:50:06,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:50:06,285 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2024-11-17 00:50:06,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:06,285 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2024-11-17 00:50:06,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-17 00:50:06,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:50:06,286 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 1] [2024-11-17 00:50:06,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 00:50:06,286 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2024-11-17 00:50:06,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:50:06,287 INFO L85 PathProgramCache]: Analyzing trace with hash -619460141, now seen corresponding path program 1 times [2024-11-17 00:50:06,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:50:06,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225488665] [2024-11-17 00:50:06,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:50:06,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:50:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:06,981 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 64 proven. 9 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-17 00:50:06,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:50:06,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225488665] [2024-11-17 00:50:06,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225488665] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:50:06,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840228999] [2024-11-17 00:50:06,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:50:06,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:50:06,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:50:06,983 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-17 00:50:06,985 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-17 00:50:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:07,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-17 00:50:07,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:50:07,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:50:07,369 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:50:07,369 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-17 00:50:07,415 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-17 00:50:07,452 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-17 00:50:07,539 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:50:07,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 37 [2024-11-17 00:50:07,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:50:07,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:07,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 33 treesize of output 23 [2024-11-17 00:50:07,767 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 68 proven. 11 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-17 00:50:07,767 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:50:08,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:08,356 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-17 00:50:08,361 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:50:08,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:08,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 49 treesize of output 39 [2024-11-17 00:50:08,374 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-17 00:50:08,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:08,414 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-17 00:50:08,419 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:50:08,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:08,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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-17 00:50:08,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 20 treesize of output 18 [2024-11-17 00:50:08,795 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 68 proven. 11 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-17 00:50:08,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840228999] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:50:08,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:50:08,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 35 [2024-11-17 00:50:08,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607797728] [2024-11-17 00:50:08,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:50:08,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-17 00:50:08,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:50:08,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-17 00:50:08,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1082, Unknown=6, NotChecked=0, Total=1190 [2024-11-17 00:50:08,798 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand has 35 states, 35 states have (on average 3.3142857142857145) internal successors, (116), 35 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:10,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:50:10,088 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2024-11-17 00:50:10,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-17 00:50:10,089 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.3142857142857145) internal successors, (116), 35 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-17 00:50:10,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:50:10,089 INFO L225 Difference]: With dead ends: 141 [2024-11-17 00:50:10,089 INFO L226 Difference]: Without dead ends: 136 [2024-11-17 00:50:10,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=468, Invalid=2717, Unknown=7, NotChecked=0, Total=3192 [2024-11-17 00:50:10,091 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 96 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:50:10,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1046 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 00:50:10,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-17 00:50:10,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2024-11-17 00:50:10,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 117 states have (on average 1.2136752136752136) internal successors, (142), 131 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2024-11-17 00:50:10,094 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 76 [2024-11-17 00:50:10,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:50:10,095 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2024-11-17 00:50:10,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.3142857142857145) internal successors, (116), 35 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:10,095 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2024-11-17 00:50:10,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-17 00:50:10,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:50:10,096 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 1] [2024-11-17 00:50:10,115 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-17 00:50:10,296 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-17 00:50:10,297 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2024-11-17 00:50:10,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:50:10,297 INFO L85 PathProgramCache]: Analyzing trace with hash 473598512, now seen corresponding path program 1 times [2024-11-17 00:50:10,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:50:10,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532631973] [2024-11-17 00:50:10,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:50:10,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:50:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:11,262 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 58 proven. 33 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-17 00:50:11,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:50:11,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532631973] [2024-11-17 00:50:11,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532631973] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:50:11,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990474601] [2024-11-17 00:50:11,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:50:11,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:50:11,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:50:11,265 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-17 00:50:11,266 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-17 00:50:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:11,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-17 00:50:11,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:50:11,545 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-17 00:50:11,567 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:50:11,567 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-17 00:50:11,584 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-17 00:50:11,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-17 00:50:11,612 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-17 00:50:11,620 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-17 00:50:11,694 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 68 proven. 11 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-17 00:50:11,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:50:12,361 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2853) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2854) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0) (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_2853 .cse0))) v_ArrVal_2853)))) is different from false [2024-11-17 00:50:12,371 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (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_2853 .cse0))) .cse1 (select v_ArrVal_2853 .cse1))) v_ArrVal_2853)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2853) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2854) |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-17 00:50:12,377 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-17 00:50:12,381 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-17 00:50:12,435 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 68 proven. 9 refuted. 0 times theorem prover too weak. 37 trivial. 2 not checked. [2024-11-17 00:50:12,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990474601] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:50:12,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:50:12,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 24 [2024-11-17 00:50:12,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806896569] [2024-11-17 00:50:12,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:50:12,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-17 00:50:12,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:50:12,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-17 00:50:12,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=393, Unknown=13, NotChecked=82, Total=552 [2024-11-17 00:50:12,441 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:12,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:50:12,826 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2024-11-17 00:50:12,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:50:12,827 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-17 00:50:12,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:50:12,827 INFO L225 Difference]: With dead ends: 132 [2024-11-17 00:50:12,828 INFO L226 Difference]: Without dead ends: 132 [2024-11-17 00:50:12,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 146 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=126, Invalid=680, Unknown=14, NotChecked=110, Total=930 [2024-11-17 00:50:12,829 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 17 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:50:12,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 927 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 426 Invalid, 0 Unknown, 84 Unchecked, 0.2s Time] [2024-11-17 00:50:12,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-17 00:50:12,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-17 00:50:12,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 117 states have (on average 1.205128205128205) internal successors, (141), 131 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:12,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2024-11-17 00:50:12,832 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 76 [2024-11-17 00:50:12,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:50:12,833 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2024-11-17 00:50:12,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:12,833 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2024-11-17 00:50:12,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-17 00:50:12,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:50:12,834 INFO L215 NwaCegarLoop]: trace histogram [6, 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] [2024-11-17 00:50:12,850 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-17 00:50:13,034 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-17 00:50:13,035 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2024-11-17 00:50:13,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:50:13,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1798777078, now seen corresponding path program 1 times [2024-11-17 00:50:13,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:50:13,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259691386] [2024-11-17 00:50:13,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:50:13,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:50:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:13,837 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 58 proven. 35 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-17 00:50:13,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:50:13,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259691386] [2024-11-17 00:50:13,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259691386] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:50:13,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700424062] [2024-11-17 00:50:13,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:50:13,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:50:13,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:50:13,840 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-17 00:50:13,841 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-17 00:50:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:14,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-17 00:50:14,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:50:14,157 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-17 00:50:14,176 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:50:14,176 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-17 00:50:14,196 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-17 00:50:14,218 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-17 00:50:14,255 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 00:50:14,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-17 00:50:14,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:14,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 16 [2024-11-17 00:50:14,437 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 68 proven. 13 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-17 00:50:14,437 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:50:14,530 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-17 00:50:14,530 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-17 00:50:14,534 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3226 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3226) |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-17 00:50:15,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:15,193 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-17 00:50:15,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:15,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 28 [2024-11-17 00:50:15,200 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-17 00:50:15,247 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 68 proven. 11 refuted. 0 times theorem prover too weak. 37 trivial. 2 not checked. [2024-11-17 00:50:15,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700424062] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:50:15,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:50:15,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2024-11-17 00:50:15,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372502051] [2024-11-17 00:50:15,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:50:15,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-17 00:50:15,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:50:15,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-17 00:50:15,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=617, Unknown=13, NotChecked=50, Total=756 [2024-11-17 00:50:15,250 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 28 states, 27 states have (on average 4.777777777777778) internal successors, (129), 28 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-17 00:50:15,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:50:15,912 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2024-11-17 00:50:15,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-17 00:50:15,913 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.777777777777778) internal successors, (129), 28 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-17 00:50:15,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:50:15,914 INFO L225 Difference]: With dead ends: 135 [2024-11-17 00:50:15,914 INFO L226 Difference]: Without dead ends: 135 [2024-11-17 00:50:15,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=224, Invalid=1247, Unknown=15, NotChecked=74, Total=1560 [2024-11-17 00:50:15,915 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 75 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:50:15,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 633 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 882 Invalid, 0 Unknown, 101 Unchecked, 0.4s Time] [2024-11-17 00:50:15,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-17 00:50:15,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-17 00:50:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 120 states have (on average 1.2083333333333333) internal successors, (145), 134 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2024-11-17 00:50:15,918 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 77 [2024-11-17 00:50:15,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:50:15,919 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2024-11-17 00:50:15,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.777777777777778) internal successors, (129), 28 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-17 00:50:15,919 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2024-11-17 00:50:15,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-17 00:50:15,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:50:15,919 INFO L215 NwaCegarLoop]: trace histogram [6, 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] [2024-11-17 00:50:15,937 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-17 00:50:16,124 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-17 00:50:16,125 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2024-11-17 00:50:16,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:50:16,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1798777079, now seen corresponding path program 1 times [2024-11-17 00:50:16,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:50:16,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483090883] [2024-11-17 00:50:16,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:50:16,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:50:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:17,317 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 68 proven. 29 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-17 00:50:17,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:50:17,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483090883] [2024-11-17 00:50:17,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483090883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:50:17,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41942167] [2024-11-17 00:50:17,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:50:17,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:50:17,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:50:17,321 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-17 00:50:17,322 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-17 00:50:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:17,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-17 00:50:17,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:50:17,599 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-17 00:50:17,655 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:50:17,655 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-17 00:50:17,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 13 treesize of output 9 [2024-11-17 00:50:17,694 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-17 00:50:17,730 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-17 00:50:17,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-17 00:50:17,786 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 00:50:17,786 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 71 treesize of output 64 [2024-11-17 00:50:17,791 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 39 treesize of output 20 [2024-11-17 00:50:18,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2024-11-17 00:50:18,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:18,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2024-11-17 00:50:18,105 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 68 proven. 13 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-17 00:50:18,106 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:50:18,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:18,319 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 48 treesize of output 52 [2024-11-17 00:50:18,350 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_prenex_1 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)))) (forall ((v_ArrVal_3600 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3600) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9))) (forall ((v_ArrVal_3601 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3601) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from false [2024-11-17 00:50:18,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:18,443 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 29 treesize of output 35 [2024-11-17 00:50:18,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:18,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 32 [2024-11-17 00:50:18,456 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-17 00:50:18,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 1 [2024-11-17 00:50:18,461 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-17 00:50:18,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 1 [2024-11-17 00:50:18,624 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 68 proven. 11 refuted. 0 times theorem prover too weak. 37 trivial. 2 not checked. [2024-11-17 00:50:18,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41942167] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:50:18,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:50:18,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 36 [2024-11-17 00:50:18,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940736438] [2024-11-17 00:50:18,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:50:18,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-17 00:50:18,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:50:18,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-17 00:50:18,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1142, Unknown=10, NotChecked=68, Total=1332 [2024-11-17 00:50:18,626 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand has 37 states, 36 states have (on average 4.138888888888889) internal successors, (149), 37 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-17 00:50:19,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:50:19,657 INFO L93 Difference]: Finished difference Result 183 states and 205 transitions. [2024-11-17 00:50:19,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-17 00:50:19,658 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 4.138888888888889) internal successors, (149), 37 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) Word has length 77 [2024-11-17 00:50:19,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:50:19,658 INFO L225 Difference]: With dead ends: 183 [2024-11-17 00:50:19,658 INFO L226 Difference]: Without dead ends: 183 [2024-11-17 00:50:19,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=294, Invalid=2052, Unknown=10, NotChecked=94, Total=2450 [2024-11-17 00:50:19,660 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 153 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:50:19,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 842 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 923 Invalid, 0 Unknown, 133 Unchecked, 0.5s Time] [2024-11-17 00:50:19,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-17 00:50:19,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 158. [2024-11-17 00:50:19,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 144 states have (on average 1.2083333333333333) internal successors, (174), 157 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 174 transitions. [2024-11-17 00:50:19,664 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 174 transitions. Word has length 77 [2024-11-17 00:50:19,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:50:19,664 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 174 transitions. [2024-11-17 00:50:19,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 4.138888888888889) internal successors, (149), 37 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-17 00:50:19,664 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 174 transitions. [2024-11-17 00:50:19,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-17 00:50:19,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:50:19,665 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:50:19,683 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-17 00:50:19,865 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-17 00:50:19,866 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2024-11-17 00:50:19,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:50:19,866 INFO L85 PathProgramCache]: Analyzing trace with hash -49729318, now seen corresponding path program 1 times [2024-11-17 00:50:19,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:50:19,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820886336] [2024-11-17 00:50:19,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:50:19,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:50:19,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-17 00:50:20,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:50:20,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820886336] [2024-11-17 00:50:20,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820886336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:50:20,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430554285] [2024-11-17 00:50:20,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:50:20,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:50:20,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:50:20,129 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-17 00:50:20,131 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-17 00:50:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:20,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-17 00:50:20,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:50:20,483 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-17 00:50:20,498 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-17 00:50:20,515 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-17 00:50:20,532 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-17 00:50:20,548 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-17 00:50:20,589 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:50:20,589 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-17 00:50:20,593 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-17 00:50:20,593 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:50:20,738 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-17 00:50:20,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430554285] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:50:20,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:50:20,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 5 [2024-11-17 00:50:20,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548419916] [2024-11-17 00:50:20,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:50:20,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:50:20,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:50:20,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:50:20,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:50:20,740 INFO L87 Difference]: Start difference. First operand 158 states and 174 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:20,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:50:20,803 INFO L93 Difference]: Finished difference Result 158 states and 172 transitions. [2024-11-17 00:50:20,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:50:20,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-17 00:50:20,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:50:20,805 INFO L225 Difference]: With dead ends: 158 [2024-11-17 00:50:20,805 INFO L226 Difference]: Without dead ends: 158 [2024-11-17 00:50:20,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 164 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-17 00:50:20,806 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 84 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:50:20,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 56 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:50:20,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-17 00:50:20,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-11-17 00:50:20,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 144 states have (on average 1.1944444444444444) internal successors, (172), 157 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:20,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 172 transitions. [2024-11-17 00:50:20,811 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 172 transitions. Word has length 83 [2024-11-17 00:50:20,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:50:20,811 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 172 transitions. [2024-11-17 00:50:20,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:20,812 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 172 transitions. [2024-11-17 00:50:20,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-17 00:50:20,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:50:20,812 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:50:20,832 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-17 00:50:21,016 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-17 00:50:21,017 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2024-11-17 00:50:21,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:50:21,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1824399168, now seen corresponding path program 1 times [2024-11-17 00:50:21,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:50:21,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527849758] [2024-11-17 00:50:21,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:50:21,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:50:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:22,699 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 77 proven. 40 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-17 00:50:22,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:50:22,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527849758] [2024-11-17 00:50:22,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527849758] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:50:22,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277554382] [2024-11-17 00:50:22,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:50:22,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:50:22,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:50:22,701 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-17 00:50:22,702 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-17 00:50:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:23,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-17 00:50:23,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:50:23,015 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-17 00:50:23,046 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 00:50:23,047 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-17 00:50:23,096 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-17 00:50:23,129 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-17 00:50:23,153 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-17 00:50:23,169 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-17 00:50:23,183 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-17 00:50:23,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:50:23,316 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-17 00:50:23,317 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-17 00:50:23,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:50:23,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:50:23,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:50:23,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:50:23,371 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-17 00:50:23,379 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-17 00:50:23,411 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-17 00:50:23,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:50:23,426 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-17 00:50:23,489 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:50:23,490 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 86 treesize of output 73 [2024-11-17 00:50:23,494 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 39 treesize of output 15 [2024-11-17 00:50:23,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-11-17 00:50:23,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-17 00:50:23,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-17 00:50:23,943 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 83 proven. 28 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-17 00:50:23,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:50:24,183 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4362 (Array Int Int)) (v_ArrVal_4363 (Array Int Int)) (v_ArrVal_4364 (Array Int Int)) (v_ArrVal_4366 Int)) (= (let ((.cse1 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4362))) (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4366))) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4364) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) (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|) .cse1 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4363) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) 0)) is different from false [2024-11-17 00:50:24,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:24,193 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 71 treesize of output 77 [2024-11-17 00:50:24,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:24,198 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 134 treesize of output 116 [2024-11-17 00:50:24,202 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-17 00:50:24,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:24,209 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 96 treesize of output 86 [2024-11-17 00:50:24,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:24,214 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 146 treesize of output 122 [2024-11-17 00:50:24,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2024-11-17 00:50:24,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:24,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-11-17 00:50:37,524 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 114 treesize of output 106 [2024-11-17 00:50:37,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-11-17 00:50:37,534 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-17 00:50:37,540 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:50:37,542 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 65 treesize of output 63 [2024-11-17 00:50:37,549 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 5 treesize of output 3 [2024-11-17 00:50:37,554 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:50:37,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:37,597 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 1758 treesize of output 1740 [2024-11-17 00:50:37,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:37,661 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 183 treesize of output 179 [2024-11-17 00:50:37,675 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 84 treesize of output 80 [2024-11-17 00:50:37,729 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 5 treesize of output 3 [2024-11-17 00:50:38,042 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 80 proven. 26 refuted. 3 times theorem prover too weak. 14 trivial. 2 not checked. [2024-11-17 00:50:38,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277554382] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:50:38,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:50:38,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 23] total 50 [2024-11-17 00:50:38,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43379751] [2024-11-17 00:50:38,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:50:38,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-17 00:50:38,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:50:38,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-17 00:50:38,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2097, Unknown=54, NotChecked=94, Total=2450 [2024-11-17 00:50:38,047 INFO L87 Difference]: Start difference. First operand 158 states and 172 transitions. Second operand has 50 states, 50 states have (on average 3.54) internal successors, (177), 50 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:39,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:50:39,335 INFO L93 Difference]: Finished difference Result 166 states and 179 transitions. [2024-11-17 00:50:39,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-17 00:50:39,336 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.54) internal successors, (177), 50 states have internal predecessors, (177), 0 states have call successors, (0), 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 87 [2024-11-17 00:50:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:50:39,336 INFO L225 Difference]: With dead ends: 166 [2024-11-17 00:50:39,337 INFO L226 Difference]: Without dead ends: 166 [2024-11-17 00:50:39,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=506, Invalid=3348, Unknown=56, NotChecked=122, Total=4032 [2024-11-17 00:50:39,338 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 48 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:50:39,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 1316 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1120 Invalid, 0 Unknown, 94 Unchecked, 0.7s Time] [2024-11-17 00:50:39,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-17 00:50:39,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 158. [2024-11-17 00:50:39,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 144 states have (on average 1.1875) internal successors, (171), 157 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-17 00:50:39,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2024-11-17 00:50:39,342 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 87 [2024-11-17 00:50:39,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:50:39,342 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2024-11-17 00:50:39,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.54) internal successors, (177), 50 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:39,342 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2024-11-17 00:50:39,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-17 00:50:39,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:50:39,343 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:50:39,360 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-17 00:50:39,544 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-17 00:50:39,544 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2024-11-17 00:50:39,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:50:39,544 INFO L85 PathProgramCache]: Analyzing trace with hash -579634016, now seen corresponding path program 1 times [2024-11-17 00:50:39,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:50:39,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702771855] [2024-11-17 00:50:39,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:50:39,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:50:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:41,425 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 75 proven. 44 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-17 00:50:41,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:50:41,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702771855] [2024-11-17 00:50:41,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702771855] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:50:41,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191799725] [2024-11-17 00:50:41,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:50:41,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:50:41,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:50:41,428 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-17 00:50:41,429 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-17 00:50:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:41,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-17 00:50:41,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:50:41,789 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-17 00:50:41,811 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 00:50:41,811 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-17 00:50:41,864 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-17 00:50:41,908 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-17 00:50:41,922 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-17 00:50:41,935 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-17 00:50:41,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:50:42,064 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-17 00:50:42,064 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-17 00:50:42,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:50:42,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:50:42,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:50:42,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:50:42,118 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-17 00:50:42,124 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-17 00:50:42,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:50:42,178 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-17 00:50:42,185 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-17 00:50:42,253 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:50:42,254 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 86 treesize of output 73 [2024-11-17 00:50:42,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-11-17 00:50:42,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-17 00:50:42,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-17 00:50:42,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-17 00:50:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 81 proven. 32 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-17 00:50:42,600 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:50:42,833 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4757 Int) (v_ArrVal_4753 (Array Int Int)) (v_ArrVal_4754 (Array Int Int)) (v_ArrVal_4755 (Array Int Int))) (= (let ((.cse1 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_4753))) (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_4757))) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4755) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)) (+ (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|) .cse1 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_4754) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) 8))) 0)) is different from false [2024-11-17 00:50:42,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:42,845 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 73 treesize of output 79 [2024-11-17 00:50:42,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:42,852 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 138 treesize of output 120 [2024-11-17 00:50:42,857 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 57 treesize of output 53 [2024-11-17 00:50:42,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:42,865 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 100 treesize of output 90 [2024-11-17 00:50:42,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:42,871 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 154 treesize of output 130 [2024-11-17 00:50:42,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2024-11-17 00:50:43,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:43,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2024-11-17 00:50:44,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:44,139 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 17849 treesize of output 17631 [2024-11-17 00:50:44,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:44,198 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 691 treesize of output 663 [2024-11-17 00:50:44,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:44,229 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 754 treesize of output 690 [2024-11-17 00:50:44,476 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 402 treesize of output 390 [2024-11-17 00:50:44,618 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:50:44,620 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 62 treesize of output 60 [2024-11-17 00:50:44,633 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-17 00:50:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 74 proven. 30 refuted. 7 times theorem prover too weak. 14 trivial. 2 not checked. [2024-11-17 00:50:44,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191799725] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:50:44,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:50:44,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 23] total 51 [2024-11-17 00:50:44,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513975049] [2024-11-17 00:50:44,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:50:44,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-17 00:50:44,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:50:44,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-17 00:50:44,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2207, Unknown=39, NotChecked=96, Total=2550 [2024-11-17 00:50:44,862 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand has 51 states, 51 states have (on average 3.6666666666666665) internal successors, (187), 51 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:46,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:50:46,361 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2024-11-17 00:50:46,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-17 00:50:46,361 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.6666666666666665) internal successors, (187), 51 states have internal predecessors, (187), 0 states have call successors, (0), 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 89 [2024-11-17 00:50:46,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:50:46,362 INFO L225 Difference]: With dead ends: 166 [2024-11-17 00:50:46,362 INFO L226 Difference]: Without dead ends: 166 [2024-11-17 00:50:46,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=519, Invalid=3606, Unknown=39, NotChecked=126, Total=4290 [2024-11-17 00:50:46,364 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 45 mSDsluCounter, 1640 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:50:46,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1700 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1578 Invalid, 0 Unknown, 93 Unchecked, 1.0s Time] [2024-11-17 00:50:46,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-17 00:50:46,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 158. [2024-11-17 00:50:46,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 144 states have (on average 1.1805555555555556) internal successors, (170), 157 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:46,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 170 transitions. [2024-11-17 00:50:46,369 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 170 transitions. Word has length 89 [2024-11-17 00:50:46,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:50:46,369 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 170 transitions. [2024-11-17 00:50:46,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.6666666666666665) internal successors, (187), 51 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:46,370 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 170 transitions. [2024-11-17 00:50:46,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-17 00:50:46,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:50:46,370 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:50:46,390 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-17 00:50:46,571 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-17 00:50:46,571 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2024-11-17 00:50:46,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:50:46,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1240664003, now seen corresponding path program 1 times [2024-11-17 00:50:46,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:50:46,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65147936] [2024-11-17 00:50:46,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:50:46,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:50:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:48,182 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 74 proven. 37 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-17 00:50:48,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:50:48,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65147936] [2024-11-17 00:50:48,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65147936] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:50:48,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875383278] [2024-11-17 00:50:48,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:50:48,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:50:48,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:50:48,186 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-17 00:50:48,187 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-17 00:50:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:48,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-17 00:50:48,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:50:48,587 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-17 00:50:48,672 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 00:50:48,672 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-17 00:50:48,751 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-17 00:50:48,796 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-17 00:50:48,868 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:50:48,869 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 49 treesize of output 44 [2024-11-17 00:50:48,965 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-17 00:50:48,966 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-17 00:50:49,017 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 40 treesize of output 29 [2024-11-17 00:50:49,033 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 40 treesize of output 29 [2024-11-17 00:50:49,048 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 40 treesize of output 29 [2024-11-17 00:50:49,063 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-17 00:50:49,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2024-11-17 00:50:49,131 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-17 00:50:49,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 47 [2024-11-17 00:50:49,143 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-17 00:50:49,221 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-17 00:50:49,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 69 [2024-11-17 00:50:49,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:50:49,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 21 [2024-11-17 00:50:49,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-17 00:50:49,699 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:50:49,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 26 [2024-11-17 00:50:49,724 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 69 proven. 36 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-17 00:50:49,724 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:50:50,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:50,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 65 [2024-11-17 00:50:50,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:50,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 65 [2024-11-17 00:50:50,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:50,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 65 [2024-11-17 00:50:50,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:50,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 65 [2024-11-17 00:50:51,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:51,105 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2024-11-17 00:50:51,930 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 78 treesize of output 70 [2024-11-17 00:50:51,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:51,940 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 77 treesize of output 71 [2024-11-17 00:50:51,944 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 50 treesize of output 46 [2024-11-17 00:50:51,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:51,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2024-11-17 00:50:51,984 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:50:51,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 31 [2024-11-17 00:50:51,990 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 39 treesize of output 31 [2024-11-17 00:50:51,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-17 00:50:52,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:52,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2024-11-17 00:50:52,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 75 [2024-11-17 00:50:52,020 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 70 treesize of output 66 [2024-11-17 00:50:52,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:52,036 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 79 treesize of output 71 [2024-11-17 00:50:52,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:52,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2024-11-17 00:50:52,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 75 [2024-11-17 00:50:52,135 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 70 treesize of output 66 [2024-11-17 00:50:52,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:52,150 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 79 treesize of output 71 [2024-11-17 00:50:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 69 proven. 36 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-17 00:50:52,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875383278] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:50:52,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:50:52,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 20] total 56 [2024-11-17 00:50:52,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720081565] [2024-11-17 00:50:52,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:50:52,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-17 00:50:52,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:50:52,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-17 00:50:52,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=2879, Unknown=2, NotChecked=0, Total=3080 [2024-11-17 00:50:52,790 INFO L87 Difference]: Start difference. First operand 158 states and 170 transitions. Second operand has 56 states, 56 states have (on average 3.7142857142857144) internal successors, (208), 56 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:54,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:50:54,987 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2024-11-17 00:50:54,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-17 00:50:54,987 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 3.7142857142857144) internal successors, (208), 56 states have internal predecessors, (208), 0 states have call successors, (0), 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 91 [2024-11-17 00:50:54,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:50:54,988 INFO L225 Difference]: With dead ends: 150 [2024-11-17 00:50:54,988 INFO L226 Difference]: Without dead ends: 150 [2024-11-17 00:50:54,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1438 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=702, Invalid=5776, Unknown=2, NotChecked=0, Total=6480 [2024-11-17 00:50:54,990 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 76 mSDsluCounter, 1968 mSDsCounter, 0 mSdLazyCounter, 1885 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 2037 SdHoareTripleChecker+Invalid, 1914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:50:54,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 2037 Invalid, 1914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1885 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-17 00:50:54,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-17 00:50:54,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 143. [2024-11-17 00:50:54,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 129 states have (on average 1.1705426356589148) internal successors, (151), 142 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:54,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2024-11-17 00:50:54,993 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 91 [2024-11-17 00:50:54,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:50:54,993 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2024-11-17 00:50:54,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 3.7142857142857144) internal successors, (208), 56 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:50:54,994 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2024-11-17 00:50:54,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-17 00:50:54,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:50:54,995 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:50:55,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-17 00:50:55,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:50:55,198 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2024-11-17 00:50:55,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:50:55,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1961244640, now seen corresponding path program 1 times [2024-11-17 00:50:55,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:50:55,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121234510] [2024-11-17 00:50:55,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:50:55,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:50:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:56,785 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 74 proven. 47 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-17 00:50:56,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:50:56,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121234510] [2024-11-17 00:50:56,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121234510] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:50:56,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894741799] [2024-11-17 00:50:56,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:50:56,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:50:56,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:50:56,788 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:50:56,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-17 00:50:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:50:57,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-17 00:50:57,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:50:57,162 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-17 00:50:57,185 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 00:50:57,185 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-17 00:50:57,229 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-17 00:50:57,261 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-17 00:50:57,270 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-17 00:50:57,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:50:57,375 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-17 00:50:57,376 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-17 00:50:57,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:50:57,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:50:57,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:50:57,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:50:57,417 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-17 00:50:57,420 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-17 00:50:57,453 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-17 00:50:57,458 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-17 00:50:57,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:50:57,520 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:50:57,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 73 [2024-11-17 00:50:57,525 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 39 treesize of output 15 [2024-11-17 00:50:57,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-11-17 00:50:57,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-17 00:50:57,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-17 00:50:57,857 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 80 proven. 35 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-17 00:50:57,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:50:58,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:58,136 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 73 treesize of output 79 [2024-11-17 00:50:58,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:58,140 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 138 treesize of output 120 [2024-11-17 00:50:58,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 57 treesize of output 53 [2024-11-17 00:50:58,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:58,150 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 100 treesize of output 90 [2024-11-17 00:50:58,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:58,154 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 154 treesize of output 130 [2024-11-17 00:50:58,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2024-11-17 00:50:58,174 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 16)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (and (or (forall ((v_ArrVal_5526 (Array Int Int))) (= 0 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_5526) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0))) .cse1) (or (not .cse1) (forall ((v_ArrVal_5527 Int) (v_ArrVal_5526 (Array Int Int)) (v_arrayElimCell_224 Int) (v_arrayElimCell_227 Int)) (= (select (select (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_5526))) (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 v_ArrVal_5527))) v_arrayElimCell_224) (+ 16 v_arrayElimCell_227)) 0))) (forall ((v_ArrVal_5527 Int) (v_ArrVal_5526 (Array Int Int)) (v_arrayElimCell_224 Int) (v_arrayElimCell_227 Int)) (let ((.cse5 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_5526))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (= 0 (select .cse4 .cse0)) (= (select (select (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse4 .cse3 v_ArrVal_5527)) v_arrayElimCell_224) (+ 16 v_arrayElimCell_227)) 0))))))) is different from false [2024-11-17 00:50:58,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:58,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2024-11-17 00:50:58,837 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:50:58,838 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 53 treesize of output 51 [2024-11-17 00:50:58,841 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-17 00:50:58,851 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-17 00:50:58,853 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 46 [2024-11-17 00:50:58,856 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-17 00:50:58,866 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:50:58,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:58,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 288 treesize of output 292 [2024-11-17 00:50:58,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:50:58,900 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 201 treesize of output 185 [2024-11-17 00:50:58,908 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 174 treesize of output 166 [2024-11-17 00:50:58,927 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-17 00:50:59,175 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 73 proven. 25 refuted. 7 times theorem prover too weak. 14 trivial. 10 not checked. [2024-11-17 00:50:59,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894741799] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:50:59,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:50:59,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 21] total 49 [2024-11-17 00:50:59,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60946399] [2024-11-17 00:50:59,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:50:59,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-17 00:50:59,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:50:59,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-17 00:50:59,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2012, Unknown=47, NotChecked=92, Total=2352 [2024-11-17 00:50:59,178 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand has 49 states, 49 states have (on average 3.938775510204082) internal successors, (193), 49 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:51:00,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:51:00,471 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2024-11-17 00:51:00,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-17 00:51:00,471 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.938775510204082) internal successors, (193), 49 states have internal predecessors, (193), 0 states have call successors, (0), 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 91 [2024-11-17 00:51:00,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:51:00,472 INFO L225 Difference]: With dead ends: 146 [2024-11-17 00:51:00,472 INFO L226 Difference]: Without dead ends: 146 [2024-11-17 00:51:00,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=496, Invalid=3243, Unknown=47, NotChecked=120, Total=3906 [2024-11-17 00:51:00,473 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 19 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:51:00,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1541 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1221 Invalid, 0 Unknown, 59 Unchecked, 0.7s Time] [2024-11-17 00:51:00,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-17 00:51:00,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2024-11-17 00:51:00,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 131 states have (on average 1.16793893129771) internal successors, (153), 144 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:51:00,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions. [2024-11-17 00:51:00,475 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 91 [2024-11-17 00:51:00,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:51:00,475 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 153 transitions. [2024-11-17 00:51:00,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.938775510204082) internal successors, (193), 49 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:51:00,476 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2024-11-17 00:51:00,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-17 00:51:00,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:51:00,476 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:51:00,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-17 00:51:00,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:51:00,677 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2024-11-17 00:51:00,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:51:00,677 INFO L85 PathProgramCache]: Analyzing trace with hash -666916602, now seen corresponding path program 2 times [2024-11-17 00:51:00,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:51:00,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785928700] [2024-11-17 00:51:00,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:51:00,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:51:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:51:02,213 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 74 proven. 53 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-17 00:51:02,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:51:02,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785928700] [2024-11-17 00:51:02,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785928700] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:51:02,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985446347] [2024-11-17 00:51:02,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:51:02,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:51:02,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:51:02,215 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:51:02,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-17 00:51:02,600 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:51:02,600 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:51:02,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-17 00:51:02,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:51:02,608 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-17 00:51:02,630 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 00:51:02,630 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-17 00:51:02,680 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-17 00:51:02,713 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-17 00:51:02,769 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:51:02,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-17 00:51:02,881 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-17 00:51:02,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-17 00:51:02,933 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 41 treesize of output 30 [2024-11-17 00:51:02,948 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 41 treesize of output 30 [2024-11-17 00:51:02,962 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 41 treesize of output 30 [2024-11-17 00:51:02,976 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-17 00:51:02,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2024-11-17 00:51:03,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-17 00:51:03,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 52 [2024-11-17 00:51:03,151 INFO L349 Elim1Store]: treesize reduction 110, result has 14.7 percent of original size [2024-11-17 00:51:03,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 146 treesize of output 76 [2024-11-17 00:51:03,165 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 39 treesize of output 20 [2024-11-17 00:51:03,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-17 00:51:04,019 INFO L349 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2024-11-17 00:51:04,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 32 [2024-11-17 00:51:04,092 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 80 proven. 41 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-17 00:51:04,092 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:51:04,320 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5914 Int) (v_ArrVal_5913 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_5913) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (or (< .cse0 0) (= (select |c_#valid| (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_5914)))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (+ .cse0 4))) 1))))) is different from false [2024-11-17 00:51:04,342 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5914 Int) (v_ArrVal_5913 (Array Int Int))) (let ((.cse4 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse2 (+ |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|) .cse4 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_5913) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (or (< .cse0 0) (= 1 (select |c_#valid| (select (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4 0)))) (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_5914))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))) (+ .cse0 4)))))))) is different from false [2024-11-17 00:51:04,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:51:04,355 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 149 treesize of output 139 [2024-11-17 00:51:04,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:51:04,360 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 259 treesize of output 235 [2024-11-17 00:51:04,366 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 119 treesize of output 111 [2024-11-17 00:51:04,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:51:04,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 66 [2024-11-17 00:51:04,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:51:04,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 179 treesize of output 115 [2024-11-17 00:51:04,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:51:04,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 66