./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 8be7027f 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-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7887c90df48e0e32a16c0ae4217eb11a41b3b1af1e02493e847dc25239198c19 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:49:32,053 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:49:32,127 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-12 12:49:32,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:49:32,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:49:32,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:49:32,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:49:32,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:49:32,160 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 12:49:32,160 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 12:49:32,161 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:49:32,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:49:32,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:49:32,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:49:32,163 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:49:32,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:49:32,163 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:49:32,164 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:49:32,164 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:49:32,165 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:49:32,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:49:32,167 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:49:32,168 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 12:49:32,168 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 12:49:32,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:49:32,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:49:32,169 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 12:49:32,169 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:49:32,170 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:49:32,170 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:49:32,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:49:32,170 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:49:32,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:49:32,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:49:32,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 12:49:32,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:49:32,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:49:32,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:49:32,182 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:49:32,182 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:49:32,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:49:32,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:49:32,183 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:49:32,184 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:49:32,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:49:32,184 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-memcleanup) ) 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 -> 7887c90df48e0e32a16c0ae4217eb11a41b3b1af1e02493e847dc25239198c19 [2024-11-12 12:49:32,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:49:32,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:49:32,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:49:32,489 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:49:32,489 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:49:32,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2024-11-12 12:49:33,924 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:49:34,159 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:49:34,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2024-11-12 12:49:34,172 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38c2a8552/3fa306bfd6b34209ace0fdf32f02c2f5/FLAG381f42ec7 [2024-11-12 12:49:34,185 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38c2a8552/3fa306bfd6b34209ace0fdf32f02c2f5 [2024-11-12 12:49:34,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:49:34,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:49:34,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:49:34,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:49:34,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:49:34,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:49:34" (1/1) ... [2024-11-12 12:49:34,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a87a726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:34, skipping insertion in model container [2024-11-12 12:49:34,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:49:34" (1/1) ... [2024-11-12 12:49:34,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:49:34,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:49:34,628 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:49:34,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:49:34,716 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:49:34,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:34 WrapperNode [2024-11-12 12:49:34,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:49:34,717 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:49:34,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:49:34,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:49:34,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:34" (1/1) ... [2024-11-12 12:49:34,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:34" (1/1) ... [2024-11-12 12:49:34,759 INFO L138 Inliner]: procedures = 123, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2024-11-12 12:49:34,759 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:49:34,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:49:34,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:49:34,760 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:49:34,769 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:34" (1/1) ... [2024-11-12 12:49:34,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:34" (1/1) ... [2024-11-12 12:49:34,773 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:34" (1/1) ... [2024-11-12 12:49:34,786 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-12 12:49:34,786 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:34" (1/1) ... [2024-11-12 12:49:34,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:34" (1/1) ... [2024-11-12 12:49:34,793 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:34" (1/1) ... [2024-11-12 12:49:34,797 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:34" (1/1) ... [2024-11-12 12:49:34,798 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:34" (1/1) ... [2024-11-12 12:49:34,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:34" (1/1) ... [2024-11-12 12:49:34,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:49:34,806 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:49:34,806 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:49:34,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:49:34,812 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:34" (1/1) ... [2024-11-12 12:49:34,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:49:34,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:49:34,847 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-12 12:49:34,849 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-12 12:49:34,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 12:49:34,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 12:49:34,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 12:49:34,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 12:49:34,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 12:49:34,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:49:34,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 12:49:34,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 12:49:34,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 12:49:34,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 12:49:34,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 12:49:34,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 12:49:34,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 12:49:34,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:49:34,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:49:35,033 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:49:35,035 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:49:35,276 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-12 12:49:35,277 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:49:35,292 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:49:35,292 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-12 12:49:35,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:49:35 BoogieIcfgContainer [2024-11-12 12:49:35,293 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:49:35,295 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:49:35,295 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:49:35,299 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:49:35,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:49:34" (1/3) ... [2024-11-12 12:49:35,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1612552f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:49:35, skipping insertion in model container [2024-11-12 12:49:35,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:34" (2/3) ... [2024-11-12 12:49:35,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1612552f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:49:35, skipping insertion in model container [2024-11-12 12:49:35,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:49:35" (3/3) ... [2024-11-12 12:49:35,303 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2024-11-12 12:49:35,319 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:49:35,320 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 12:49:35,369 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:49:35,376 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;@28f589fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:49:35,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 12:49:35,381 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:49:35,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-12 12:49:35,388 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:49:35,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:49:35,389 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:49:35,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:49:35,396 INFO L85 PathProgramCache]: Analyzing trace with hash -717918052, now seen corresponding path program 1 times [2024-11-12 12:49:35,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:49:35,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002439655] [2024-11-12 12:49:35,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:49:35,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:49:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:35,573 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-12 12:49:35,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:49:35,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002439655] [2024-11-12 12:49:35,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002439655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:49:35,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:49:35,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:49:35,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673750730] [2024-11-12 12:49:35,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:49:35,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 12:49:35,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:49:35,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 12:49:35,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 12:49:35,611 INFO L87 Difference]: Start difference. First operand has 31 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:49:35,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:49:35,623 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2024-11-12 12:49:35,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 12:49:35,624 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-12 12:49:35,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:49:35,629 INFO L225 Difference]: With dead ends: 30 [2024-11-12 12:49:35,630 INFO L226 Difference]: Without dead ends: 27 [2024-11-12 12:49:35,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 12:49:35,634 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 12:49:35,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 12:49:35,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-12 12:49:35,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-12 12:49:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:49:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-12 12:49:35,666 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 9 [2024-11-12 12:49:35,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:49:35,666 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-12 12:49:35,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:49:35,667 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-12 12:49:35,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-12 12:49:35,668 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:49:35,668 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:49:35,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 12:49:35,669 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:49:35,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:49:35,670 INFO L85 PathProgramCache]: Analyzing trace with hash -804598457, now seen corresponding path program 1 times [2024-11-12 12:49:35,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:49:35,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073754656] [2024-11-12 12:49:35,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:49:35,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:49:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:35,748 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-12 12:49:35,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:49:35,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073754656] [2024-11-12 12:49:35,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073754656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:49:35,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:49:35,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:49:35,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479454793] [2024-11-12 12:49:35,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:49:35,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:49:35,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:49:35,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:49:35,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:49:35,752 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:49:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:49:35,770 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2024-11-12 12:49:35,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:49:35,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-12 12:49:35,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:49:35,772 INFO L225 Difference]: With dead ends: 47 [2024-11-12 12:49:35,773 INFO L226 Difference]: Without dead ends: 45 [2024-11-12 12:49:35,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:49:35,775 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 18 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 63 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-12 12:49:35,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 63 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 12:49:35,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-12 12:49:35,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2024-11-12 12:49:35,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:49:35,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-12 12:49:35,782 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 10 [2024-11-12 12:49:35,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:49:35,782 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-12 12:49:35,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:49:35,782 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-12 12:49:35,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 12:49:35,783 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:49:35,783 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:49:35,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 12:49:35,783 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:49:35,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:49:35,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1811989623, now seen corresponding path program 1 times [2024-11-12 12:49:35,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:49:35,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221477557] [2024-11-12 12:49:35,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:49:35,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:49:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:35,913 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-12 12:49:35,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:49:35,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221477557] [2024-11-12 12:49:35,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221477557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:49:35,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:49:35,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:49:35,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998990635] [2024-11-12 12:49:35,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:49:35,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:49:35,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:49:35,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:49:35,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:49:35,917 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:49:35,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:49:35,988 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2024-11-12 12:49:35,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:49:35,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-12 12:49:35,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:49:35,993 INFO L225 Difference]: With dead ends: 32 [2024-11-12 12:49:35,993 INFO L226 Difference]: Without dead ends: 32 [2024-11-12 12:49:35,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:49:35,994 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 12:49:35,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 61 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 12:49:35,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-12 12:49:35,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-11-12 12:49:35,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 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-12 12:49:35,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-11-12 12:49:35,999 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 14 [2024-11-12 12:49:35,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:49:35,999 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-11-12 12:49:35,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:49:35,999 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-11-12 12:49:36,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 12:49:36,000 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:49:36,000 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:49:36,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 12:49:36,001 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:49:36,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:49:36,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1802226798, now seen corresponding path program 1 times [2024-11-12 12:49:36,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:49:36,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469345512] [2024-11-12 12:49:36,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:49:36,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:49:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:36,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:49:36,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:49:36,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469345512] [2024-11-12 12:49:36,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469345512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:49:36,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:49:36,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:49:36,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094798997] [2024-11-12 12:49:36,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:49:36,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:49:36,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:49:36,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:49:36,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:49:36,138 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:49:36,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:49:36,184 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-11-12 12:49:36,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:49:36,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-12 12:49:36,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:49:36,185 INFO L225 Difference]: With dead ends: 31 [2024-11-12 12:49:36,186 INFO L226 Difference]: Without dead ends: 31 [2024-11-12 12:49:36,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:49:36,187 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 12:49:36,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 12:49:36,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-12 12:49:36,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-12 12:49:36,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:49:36,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-11-12 12:49:36,191 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 15 [2024-11-12 12:49:36,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:49:36,191 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-12 12:49:36,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:49:36,192 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2024-11-12 12:49:36,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 12:49:36,192 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:49:36,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:49:36,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 12:49:36,193 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:49:36,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:49:36,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2099713488, now seen corresponding path program 1 times [2024-11-12 12:49:36,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:49:36,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006707117] [2024-11-12 12:49:36,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:49:36,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:49:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:36,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:49:36,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:49:36,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006707117] [2024-11-12 12:49:36,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006707117] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:49:36,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636952525] [2024-11-12 12:49:36,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:49:36,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:49:36,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:49:36,345 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-12 12:49:36,347 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-12 12:49:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:36,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 12:49:36,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:49:36,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:49:36,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:49:36,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:49:36,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636952525] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:49:36,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 12:49:36,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-12 12:49:36,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434233470] [2024-11-12 12:49:36,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 12:49:36,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 12:49:36,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:49:36,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 12:49:36,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-12 12:49:36,571 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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-12 12:49:36,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:49:36,697 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-12 12:49:36,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:49:36,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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 15 [2024-11-12 12:49:36,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:49:36,698 INFO L225 Difference]: With dead ends: 43 [2024-11-12 12:49:36,698 INFO L226 Difference]: Without dead ends: 43 [2024-11-12 12:49:36,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-12 12:49:36,700 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 12 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 12:49:36,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 148 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 12:49:36,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-12 12:49:36,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-12 12:49:36,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:49:36,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2024-11-12 12:49:36,707 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 15 [2024-11-12 12:49:36,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:49:36,707 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2024-11-12 12:49:36,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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-12 12:49:36,710 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2024-11-12 12:49:36,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-12 12:49:36,712 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:49:36,712 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:49:36,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 12:49:36,916 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-12 12:49:36,917 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:49:36,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:49:36,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1403863799, now seen corresponding path program 1 times [2024-11-12 12:49:36,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:49:36,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140795105] [2024-11-12 12:49:36,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:49:36,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:49:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-12 12:49:37,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:49:37,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140795105] [2024-11-12 12:49:37,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140795105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:49:37,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:49:37,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 12:49:37,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841470700] [2024-11-12 12:49:37,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:49:37,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:49:37,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:49:37,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:49:37,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:49:37,198 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:49:37,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:49:37,388 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2024-11-12 12:49:37,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 12:49:37,388 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-12 12:49:37,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:49:37,390 INFO L225 Difference]: With dead ends: 58 [2024-11-12 12:49:37,390 INFO L226 Difference]: Without dead ends: 58 [2024-11-12 12:49:37,390 INFO L434 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-12 12:49:37,392 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 12:49:37,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 94 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 12:49:37,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-12 12:49:37,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2024-11-12 12:49:37,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:49:37,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-11-12 12:49:37,399 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 30 [2024-11-12 12:49:37,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:49:37,400 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-12 12:49:37,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:49:37,400 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2024-11-12 12:49:37,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-12 12:49:37,402 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:49:37,402 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:49:37,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 12:49:37,402 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:49:37,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:49:37,403 INFO L85 PathProgramCache]: Analyzing trace with hash 660961867, now seen corresponding path program 1 times [2024-11-12 12:49:37,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:49:37,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072757085] [2024-11-12 12:49:37,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:49:37,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:49:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:37,719 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:49:37,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:49:37,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072757085] [2024-11-12 12:49:37,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072757085] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:49:37,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31221987] [2024-11-12 12:49:37,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:49:37,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:49:37,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:49:37,725 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-12 12:49:37,727 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-12 12:49:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:37,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 12:49:37,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:49:37,967 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:49:37,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:49:38,049 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:49:38,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31221987] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:49:38,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 12:49:38,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2024-11-12 12:49:38,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210690326] [2024-11-12 12:49:38,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 12:49:38,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 12:49:38,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:49:38,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 12:49:38,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-12 12:49:38,051 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:49:38,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:49:38,147 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2024-11-12 12:49:38,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 12:49:38,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-12 12:49:38,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:49:38,149 INFO L225 Difference]: With dead ends: 51 [2024-11-12 12:49:38,149 INFO L226 Difference]: Without dead ends: 51 [2024-11-12 12:49:38,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-12 12:49:38,150 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 12:49:38,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 92 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 12:49:38,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-12 12:49:38,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-12 12:49:38,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:49:38,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2024-11-12 12:49:38,154 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 34 [2024-11-12 12:49:38,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:49:38,154 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2024-11-12 12:49:38,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:49:38,155 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2024-11-12 12:49:38,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-12 12:49:38,155 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:49:38,156 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:49:38,174 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-12 12:49:38,356 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,SelfDestructingSolverStorable6 [2024-11-12 12:49:38,357 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:49:38,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:49:38,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1097019090, now seen corresponding path program 2 times [2024-11-12 12:49:38,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:49:38,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50658942] [2024-11-12 12:49:38,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:49:38,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:49:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:39,033 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-12 12:49:39,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:49:39,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50658942] [2024-11-12 12:49:39,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50658942] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:49:39,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114638109] [2024-11-12 12:49:39,034 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 12:49:39,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:49:39,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:49:39,037 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-12 12:49:39,039 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-12 12:49:39,256 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 12:49:39,257 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 12:49:39,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-12 12:49:39,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:49:39,303 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-12 12:49:39,327 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 12:49:39,327 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-12 12:49:39,352 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 49 treesize of output 17 [2024-11-12 12:49:39,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-12 12:49:39,480 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-12 12:49:39,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:49:40,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:49:40,178 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 5 case distinctions, treesize of input 38 treesize of output 59 [2024-11-12 12:49:40,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:49:40,190 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 26 [2024-11-12 12:49:40,233 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-12 12:49:40,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114638109] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:49:40,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 12:49:40,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 19 [2024-11-12 12:49:40,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169388609] [2024-11-12 12:49:40,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 12:49:40,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 12:49:40,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:49:40,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 12:49:40,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=284, Unknown=9, NotChecked=0, Total=342 [2024-11-12 12:49:40,236 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:49:40,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:49:40,737 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2024-11-12 12:49:40,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 12:49:40,738 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-12 12:49:40,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:49:40,738 INFO L225 Difference]: With dead ends: 63 [2024-11-12 12:49:40,738 INFO L226 Difference]: Without dead ends: 63 [2024-11-12 12:49:40,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=93, Invalid=449, Unknown=10, NotChecked=0, Total=552 [2024-11-12 12:49:40,739 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 42 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 12:49:40,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 223 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 12:49:40,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-12 12:49:40,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2024-11-12 12:49:40,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.2) internal successors, (60), 51 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-12 12:49:40,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2024-11-12 12:49:40,744 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 39 [2024-11-12 12:49:40,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:49:40,744 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2024-11-12 12:49:40,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:49:40,745 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2024-11-12 12:49:40,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-12 12:49:40,745 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:49:40,746 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:49:40,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 12:49:40,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:49:40,947 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:49:40,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:49:40,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1422940844, now seen corresponding path program 1 times [2024-11-12 12:49:40,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:49:40,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175176776] [2024-11-12 12:49:40,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:49:40,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:49:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 28 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-12 12:49:41,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:49:41,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175176776] [2024-11-12 12:49:41,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175176776] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:49:41,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867782299] [2024-11-12 12:49:41,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:49:41,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:49:41,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:49:41,780 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-12 12:49:41,785 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-12 12:49:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:42,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-12 12:49:42,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:49:42,007 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-12 12:49:42,021 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 12:49:42,021 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-12 12:49:42,051 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 82 treesize of output 77 [2024-11-12 12:49:42,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 112 [2024-11-12 12:49:42,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:49:42,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 143 [2024-11-12 12:49:42,166 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:49:42,167 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:49:42,168 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:49:42,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 26 [2024-11-12 12:49: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 62 treesize of output 47 [2024-11-12 12:49:42,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:49:42,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 35 [2024-11-12 12:49:42,514 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-12 12:49:42,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:49:42,616 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1112 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1112) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0)) is different from false [2024-11-12 12:49:42,630 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 90 treesize of output 86 [2024-11-12 12:49:42,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:49:42,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 62 treesize of output 123 [2024-11-12 12:49:42,688 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-12 12:49:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2024-11-12 12:49:42,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867782299] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:49:42,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 12:49:42,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 26 [2024-11-12 12:49:42,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624359014] [2024-11-12 12:49:42,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 12:49:42,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-12 12:49:42,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:49:42,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-12 12:49:42,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=533, Unknown=1, NotChecked=46, Total=650 [2024-11-12 12:49:42,772 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:49:43,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:49:43,328 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2024-11-12 12:49:43,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 12:49:43,329 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-12 12:49:43,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:49:43,330 INFO L225 Difference]: With dead ends: 63 [2024-11-12 12:49:43,330 INFO L226 Difference]: Without dead ends: 63 [2024-11-12 12:49:43,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=975, Unknown=1, NotChecked=64, Total=1190 [2024-11-12 12:49:43,331 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 54 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 12:49:43,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 294 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 316 Invalid, 0 Unknown, 37 Unchecked, 0.3s Time] [2024-11-12 12:49:43,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-12 12:49:43,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2024-11-12 12:49:43,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 53 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:49:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2024-11-12 12:49:43,335 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 39 [2024-11-12 12:49:43,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:49:43,335 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-11-12 12:49:43,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:49:43,336 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2024-11-12 12:49:43,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-12 12:49:43,336 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:49:43,337 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:49:43,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 12:49:43,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:49:43,541 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:49:43,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:49:43,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1421093802, now seen corresponding path program 1 times [2024-11-12 12:49:43,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:49:43,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588191448] [2024-11-12 12:49:43,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:49:43,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:49:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:49:43,645 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 12:49:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:49:43,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 12:49:43,734 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 12:49:43,735 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-12 12:49:43,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-12 12:49:43,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 12:49:43,742 INFO L421 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:49:43,783 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 12:49:43,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:49:43 BoogieIcfgContainer [2024-11-12 12:49:43,786 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 12:49:43,786 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 12:49:43,787 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 12:49:43,787 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 12:49:43,787 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:49:35" (3/4) ... [2024-11-12 12:49:43,788 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-12 12:49:43,843 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 12:49:43,844 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 12:49:43,844 INFO L158 Benchmark]: Toolchain (without parser) took 9655.31ms. Allocated memory was 153.1MB in the beginning and 268.4MB in the end (delta: 115.3MB). Free memory was 74.3MB in the beginning and 209.0MB in the end (delta: -134.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:49:43,845 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 153.1MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:49:43,845 INFO L158 Benchmark]: CACSL2BoogieTranslator took 515.89ms. Allocated memory is still 153.1MB. Free memory was 125.0MB in the beginning and 108.0MB in the end (delta: 17.0MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2024-11-12 12:49:43,845 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.93ms. Allocated memory is still 153.1MB. Free memory was 108.0MB in the beginning and 105.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 12:49:43,845 INFO L158 Benchmark]: Boogie Preprocessor took 45.92ms. Allocated memory is still 153.1MB. Free memory was 105.9MB in the beginning and 103.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 12:49:43,846 INFO L158 Benchmark]: RCFGBuilder took 486.57ms. Allocated memory is still 153.1MB. Free memory was 103.3MB in the beginning and 110.8MB in the end (delta: -7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-12 12:49:43,846 INFO L158 Benchmark]: TraceAbstraction took 8491.15ms. Allocated memory was 153.1MB in the beginning and 268.4MB in the end (delta: 115.3MB). Free memory was 109.9MB in the beginning and 212.1MB in the end (delta: -102.2MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2024-11-12 12:49:43,846 INFO L158 Benchmark]: Witness Printer took 57.40ms. Allocated memory is still 268.4MB. Free memory was 212.1MB in the beginning and 209.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 12:49:43,848 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 153.1MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 515.89ms. Allocated memory is still 153.1MB. Free memory was 125.0MB in the beginning and 108.0MB in the end (delta: 17.0MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.93ms. Allocated memory is still 153.1MB. Free memory was 108.0MB in the beginning and 105.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.92ms. Allocated memory is still 153.1MB. Free memory was 105.9MB in the beginning and 103.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 486.57ms. Allocated memory is still 153.1MB. Free memory was 103.3MB in the beginning and 110.8MB in the end (delta: -7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8491.15ms. Allocated memory was 153.1MB in the beginning and 268.4MB in the end (delta: 115.3MB). Free memory was 109.9MB in the beginning and 212.1MB in the end (delta: -102.2MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * Witness Printer took 57.40ms. Allocated memory is still 268.4MB. Free memory was 212.1MB in the beginning and 209.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L599] const int len = 5; [L600] CALL, EXPR dll_create(len) [L579] DLL head = ((void *)0); VAL [head={0:0}, len=5] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [head={0:0}, len=5, new_head={-1:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) [L590] COND FALSE !(\read(head)) [L593] head = new_head [L594] len-- [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [head={-1:0}, len=4, new_head={-2:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) [L590] COND TRUE \read(head) [L591] head->prev = new_head [L593] head = new_head [L594] len-- [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [head={-2:0}, len=3, new_head={-3:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) [L590] COND TRUE \read(head) [L591] head->prev = new_head [L593] head = new_head [L594] len-- [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [head={-3:0}, len=2, new_head={-4:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) [L590] COND TRUE \read(head) [L591] head->prev = new_head [L593] head = new_head [L594] len-- [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [head={-4:0}, len=1, new_head={-5:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) [L590] COND TRUE \read(head) [L591] head->prev = new_head [L593] head = new_head [L594] len-- [L580] COND FALSE !(len > 0) VAL [head={-5:0}] [L596] return head; VAL [\result={-5:0}] [L600] RET, EXPR dll_create(len) [L600] DLL head = dll_create(len); [L601] head->next [L601] COND TRUE head->next [L602] EXPR head->data_0 [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [head={-5:0}] [L602] EXPR 0 != head->data_0 || 0 != head->data_1 [L602] EXPR head->data_1 [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [head={-5:0}] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [head={-5:0}] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L602] EXPR head->data_2 [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [head={-5:0}] [L602] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L616] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "dll_nullified-1.c", 3, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: 598]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 156 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 1075 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 37 IncrementalHoareTripleChecker+Unchecked, 815 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 729 IncrementalHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 260 mSDtfsCounter, 729 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 315 GetRequests, 237 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=9, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 44 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 371 NumberOfCodeBlocks, 371 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 442 ConstructedInterpolants, 2 QuantifiedInterpolants, 1649 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1450 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 323/470 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-12 12:49:43,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)