./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/list_search-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/list_search-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 ef935aaf7590747bfbe771bbb249e6b84337edbf0e97024d9de82d0d23d44f30 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:09:48,325 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:09:48,402 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-19 06:09:48,407 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:09:48,409 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:09:48,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:09:48,434 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:09:48,434 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:09:48,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:09:48,438 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:09:48,439 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:09:48,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:09:48,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:09:48,440 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:09:48,440 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:09:48,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:09:48,440 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:09:48,440 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:09:48,440 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:09:48,441 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:09:48,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:09:48,444 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:09:48,444 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:09:48,444 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:09:48,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:09:48,444 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:09:48,445 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:09:48,445 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:09:48,445 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:09:48,445 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:09:48,446 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:09:48,446 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:09:48,446 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:09:48,446 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:09:48,446 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:09:48,447 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:09:48,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:09:48,447 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:09:48,447 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:09:48,447 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:09:48,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:09:48,448 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:09:48,448 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:09:48,448 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:09:48,449 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:09:48,449 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 -> ef935aaf7590747bfbe771bbb249e6b84337edbf0e97024d9de82d0d23d44f30 [2024-11-19 06:09:48,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:09:48,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:09:48,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:09:48,704 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:09:48,705 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:09:48,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_search-1.i [2024-11-19 06:09:49,997 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:09:50,183 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:09:50,185 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-1.i [2024-11-19 06:09:50,196 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f9eca18b/e2dbac6870214622afd26cc2f1cef5f1/FLAG386ece6bb [2024-11-19 06:09:50,207 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f9eca18b/e2dbac6870214622afd26cc2f1cef5f1 [2024-11-19 06:09:50,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:09:50,210 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:09:50,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:09:50,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:09:50,215 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:09:50,216 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:09:50" (1/1) ... [2024-11-19 06:09:50,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bde3c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:50, skipping insertion in model container [2024-11-19 06:09:50,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:09:50" (1/1) ... [2024-11-19 06:09:50,251 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:09:50,497 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:09:50,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:09:50,512 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:09:50,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:09:50,584 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:09:50,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:50 WrapperNode [2024-11-19 06:09:50,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:09:50,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:09:50,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:09:50,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:09:50,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:50" (1/1) ... [2024-11-19 06:09:50,609 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:50" (1/1) ... [2024-11-19 06:09:50,628 INFO L138 Inliner]: procedures = 125, calls = 23, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 68 [2024-11-19 06:09:50,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:09:50,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:09:50,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:09:50,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:09:50,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:50" (1/1) ... [2024-11-19 06:09:50,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:50" (1/1) ... [2024-11-19 06:09:50,642 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:50" (1/1) ... [2024-11-19 06:09:50,655 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-11-19 06:09:50,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:50" (1/1) ... [2024-11-19 06:09:50,656 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:50" (1/1) ... [2024-11-19 06:09:50,661 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:50" (1/1) ... [2024-11-19 06:09:50,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:50" (1/1) ... [2024-11-19 06:09:50,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:50" (1/1) ... [2024-11-19 06:09:50,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:50" (1/1) ... [2024-11-19 06:09:50,668 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:09:50,669 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:09:50,669 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:09:50,669 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:09:50,670 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:50" (1/1) ... [2024-11-19 06:09:50,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:09:50,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:09:50,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:09:50,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:09:50,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 06:09:50,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 06:09:50,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 06:09:50,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 06:09:50,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:09:50,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:09:50,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:09:50,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:09:50,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:09:50,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:09:50,768 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2024-11-19 06:09:50,768 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2024-11-19 06:09:50,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:09:50,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 06:09:50,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 06:09:50,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:09:50,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:09:50,886 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:09:50,888 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:09:51,037 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-19 06:09:51,040 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:09:51,052 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:09:51,052 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 06:09:51,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:09:51 BoogieIcfgContainer [2024-11-19 06:09:51,053 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:09:51,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:09:51,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:09:51,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:09:51,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:09:50" (1/3) ... [2024-11-19 06:09:51,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bef585d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:09:51, skipping insertion in model container [2024-11-19 06:09:51,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:09:50" (2/3) ... [2024-11-19 06:09:51,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bef585d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:09:51, skipping insertion in model container [2024-11-19 06:09:51,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:09:51" (3/3) ... [2024-11-19 06:09:51,062 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search-1.i [2024-11-19 06:09:51,108 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:09:51,108 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 06:09:51,167 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:09:51,172 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;@42db1be7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:09:51,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 06:09:51,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 26 states have internal predecessors, (34), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:09:51,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 06:09:51,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:09:51,182 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:09:51,182 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:09:51,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:09:51,186 INFO L85 PathProgramCache]: Analyzing trace with hash -709263031, now seen corresponding path program 1 times [2024-11-19 06:09:51,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:09:51,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273996984] [2024-11-19 06:09:51,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:09:51,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:09:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:09:51,637 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 06:09:51,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:09:51,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273996984] [2024-11-19 06:09:51,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273996984] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:09:51,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261172702] [2024-11-19 06:09:51,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:09:51,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:09:51,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:09:51,642 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:09:51,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 06:09:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:09:51,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 06:09:51,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:09:51,812 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 06:09:51,812 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:09:51,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261172702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:09:51,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:09:51,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2024-11-19 06:09:51,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426436713] [2024-11-19 06:09:51,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:09:51,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:09:51,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:09:51,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:09:51,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:09:51,846 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 26 states have internal predecessors, (34), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:09:51,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:09:51,860 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2024-11-19 06:09:51,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:09:51,862 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2024-11-19 06:09:51,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:09:51,867 INFO L225 Difference]: With dead ends: 31 [2024-11-19 06:09:51,868 INFO L226 Difference]: Without dead ends: 29 [2024-11-19 06:09:51,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:09:51,872 INFO L432 NwaCegarLoop]: 37 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, 37 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-19 06:09:51,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:09:51,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-19 06:09:51,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-19 06:09:51,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:09:51,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-19 06:09:51,903 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 37 [2024-11-19 06:09:51,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:09:51,905 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-19 06:09:51,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:09:51,905 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-11-19 06:09:51,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 06:09:51,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:09:51,906 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:09:51,921 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-19 06:09:52,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 06:09:52,108 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:09:52,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:09:52,109 INFO L85 PathProgramCache]: Analyzing trace with hash 542969250, now seen corresponding path program 1 times [2024-11-19 06:09:52,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:09:52,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111238546] [2024-11-19 06:09:52,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:09:52,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:09:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:09:52,308 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 06:09:52,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:09:52,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111238546] [2024-11-19 06:09:52,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111238546] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:09:52,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115496834] [2024-11-19 06:09:52,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:09:52,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:09:52,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:09:52,311 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:09:52,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 06:09:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:09:52,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:09:52,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:09:52,509 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 06:09:52,510 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:09:52,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115496834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:09:52,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:09:52,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2024-11-19 06:09:52,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720258326] [2024-11-19 06:09:52,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:09:52,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:09:52,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:09:52,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:09:52,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:09:52,517 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:09:52,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:09:52,554 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-11-19 06:09:52,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:09:52,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2024-11-19 06:09:52,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:09:52,556 INFO L225 Difference]: With dead ends: 33 [2024-11-19 06:09:52,556 INFO L226 Difference]: Without dead ends: 33 [2024-11-19 06:09:52,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 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-19 06:09:52,557 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:09:52,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 64 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:09:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-19 06:09:52,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-11-19 06:09:52,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:09:52,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-11-19 06:09:52,562 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 39 [2024-11-19 06:09:52,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:09:52,562 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-19 06:09:52,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:09:52,563 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-11-19 06:09:52,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 06:09:52,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:09:52,564 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:09:52,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 06:09:52,767 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,SelfDestructingSolverStorable1 [2024-11-19 06:09:52,768 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:09:52,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:09:52,768 INFO L85 PathProgramCache]: Analyzing trace with hash -555320518, now seen corresponding path program 1 times [2024-11-19 06:09:52,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:09:52,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776013581] [2024-11-19 06:09:52,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:09:52,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:09:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:09:53,215 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 06:09:53,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:09:53,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776013581] [2024-11-19 06:09:53,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776013581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:09:53,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:09:53,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:09:53,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288647803] [2024-11-19 06:09:53,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:09:53,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:09:53,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:09:53,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:09:53,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:09:53,219 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:09:53,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:09:53,372 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2024-11-19 06:09:53,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:09:53,374 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2024-11-19 06:09:53,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:09:53,376 INFO L225 Difference]: With dead ends: 41 [2024-11-19 06:09:53,377 INFO L226 Difference]: Without dead ends: 41 [2024-11-19 06:09:53,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:09:53,379 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 31 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:09:53,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 107 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:09:53,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-19 06:09:53,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-11-19 06:09:53,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 06:09:53,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-11-19 06:09:53,388 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 39 [2024-11-19 06:09:53,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:09:53,388 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-11-19 06:09:53,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:09:53,389 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-11-19 06:09:53,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 06:09:53,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:09:53,391 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:09:53,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:09:53,391 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:09:53,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:09:53,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1364667144, now seen corresponding path program 1 times [2024-11-19 06:09:53,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:09:53,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335939700] [2024-11-19 06:09:53,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:09:53,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:09:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:09:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 06:09:53,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:09:53,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335939700] [2024-11-19 06:09:53,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335939700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:09:53,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:09:53,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:09:53,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526323991] [2024-11-19 06:09:53,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:09:53,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:09:53,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:09:53,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:09:53,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:09:53,520 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:09:53,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:09:53,579 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2024-11-19 06:09:53,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:09:53,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2024-11-19 06:09:53,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:09:53,581 INFO L225 Difference]: With dead ends: 39 [2024-11-19 06:09:53,581 INFO L226 Difference]: Without dead ends: 39 [2024-11-19 06:09:53,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:09:53,582 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 31 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:09:53,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 109 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:09:53,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-19 06:09:53,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2024-11-19 06:09:53,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 06:09:53,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-11-19 06:09:53,586 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 39 [2024-11-19 06:09:53,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:09:53,586 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-11-19 06:09:53,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:09:53,586 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-11-19 06:09:53,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 06:09:53,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:09:53,588 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:09:53,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:09:53,589 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:09:53,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:09:53,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1597480044, now seen corresponding path program 1 times [2024-11-19 06:09:53,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:09:53,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030596194] [2024-11-19 06:09:53,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:09:53,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:09:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:09:54,588 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 06:09:54,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:09:54,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030596194] [2024-11-19 06:09:54,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030596194] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:09:54,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051993311] [2024-11-19 06:09:54,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:09:54,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:09:54,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:09:54,591 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:09:54,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 06:09:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:09:54,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-19 06:09:54,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:09:54,775 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 18 treesize of output 7 [2024-11-19 06:09:54,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:09:54,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 21 [2024-11-19 06:09:54,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:09:55,036 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 06:09:55,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-19 06:09:55,186 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 27 treesize of output 15 [2024-11-19 06:09:55,189 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 7 treesize of output 3 [2024-11-19 06:09:55,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:09:55,289 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 45 treesize of output 33 [2024-11-19 06:09:55,322 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 06:09:55,322 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:09:55,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:09:55,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2024-11-19 06:09:55,554 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_~head~0.base_22 Int) (v_arrayElimArr_2 (Array Int Int))) (or (not (= (select (select (store |c_#memory_int#1| v_~head~0.base_22 v_arrayElimArr_2) c_~head~0.base) c_~head~0.offset) 2)) (not (= 3 (select v_arrayElimArr_2 0))))) is different from false [2024-11-19 06:09:55,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051993311] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:09:55,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:09:55,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2024-11-19 06:09:55,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584680666] [2024-11-19 06:09:55,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:09:55,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-19 06:09:55,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:09:55,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 06:09:55,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=963, Unknown=1, NotChecked=62, Total=1122 [2024-11-19 06:09:55,558 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 25 states have internal predecessors, (53), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 06:09:56,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:09:56,357 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2024-11-19 06:09:56,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 06:09:56,359 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 25 states have internal predecessors, (53), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2024-11-19 06:09:56,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:09:56,360 INFO L225 Difference]: With dead ends: 53 [2024-11-19 06:09:56,361 INFO L226 Difference]: Without dead ends: 53 [2024-11-19 06:09:56,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=236, Invalid=2023, Unknown=1, NotChecked=92, Total=2352 [2024-11-19 06:09:56,362 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 60 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:09:56,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 305 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:09:56,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-19 06:09:56,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2024-11-19 06:09:56,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.170731707317073) internal successors, (48), 42 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 06:09:56,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2024-11-19 06:09:56,370 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 42 [2024-11-19 06:09:56,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:09:56,371 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2024-11-19 06:09:56,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 25 states have internal predecessors, (53), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 06:09:56,372 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2024-11-19 06:09:56,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 06:09:56,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:09:56,373 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:09:56,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 06:09:56,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:09:56,576 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:09:56,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:09:56,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1325227135, now seen corresponding path program 1 times [2024-11-19 06:09:56,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:09:56,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139330413] [2024-11-19 06:09:56,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:09:56,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:09:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:09:56,920 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 06:09:56,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:09:56,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139330413] [2024-11-19 06:09:56,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139330413] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:09:56,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769799509] [2024-11-19 06:09:56,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:09:56,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:09:56,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:09:56,923 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:09:56,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 06:09:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:09:57,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 06:09:57,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:09:57,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:09:57,131 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 16 treesize of output 8 [2024-11-19 06:09:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 06:09:57,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:09:57,274 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 06:09:57,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769799509] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:09:57,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:09:57,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 17 [2024-11-19 06:09:57,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892278254] [2024-11-19 06:09:57,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:09:57,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 06:09:57,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:09:57,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 06:09:57,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-11-19 06:09:57,278 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 16 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 06:09:57,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:09:57,500 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2024-11-19 06:09:57,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 06:09:57,503 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 16 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 43 [2024-11-19 06:09:57,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:09:57,503 INFO L225 Difference]: With dead ends: 52 [2024-11-19 06:09:57,503 INFO L226 Difference]: Without dead ends: 52 [2024-11-19 06:09:57,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2024-11-19 06:09:57,504 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 49 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:09:57,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 203 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:09:57,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-19 06:09:57,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2024-11-19 06:09:57,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 states have internal predecessors, (43), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 06:09:57,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2024-11-19 06:09:57,508 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 43 [2024-11-19 06:09:57,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:09:57,508 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-11-19 06:09:57,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 16 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 06:09:57,509 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2024-11-19 06:09:57,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 06:09:57,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:09:57,509 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:09:57,523 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-19 06:09:57,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:09:57,714 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:09:57,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:09:57,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1067608582, now seen corresponding path program 2 times [2024-11-19 06:09:57,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:09:57,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101148577] [2024-11-19 06:09:57,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:09:57,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:09:57,755 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:09:57,757 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:09:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:09:59,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:09:59,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101148577] [2024-11-19 06:09:59,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101148577] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:09:59,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121876882] [2024-11-19 06:09:59,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:09:59,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:09:59,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:09:59,416 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:09:59,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 06:09:59,578 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:09:59,579 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:09:59,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-11-19 06:09:59,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:09:59,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:09:59,631 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 22 treesize of output 1 [2024-11-19 06:09:59,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:09:59,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:09:59,967 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 06:09:59,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-19 06:09:59,992 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2024-11-19 06:09:59,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2024-11-19 06:10:00,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-19 06:10:00,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-19 06:10:00,200 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 06:10:00,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-19 06:10:00,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:10:00,213 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 53 treesize of output 36 [2024-11-19 06:10:00,222 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-19 06:10:00,222 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 1 case distinctions, treesize of input 24 treesize of output 31 [2024-11-19 06:10:00,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:10:00,238 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2024-11-19 06:10:00,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2024-11-19 06:10:00,480 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:10:00,480 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 33 [2024-11-19 06:10:00,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 06:10:00,572 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 15 treesize of output 7 [2024-11-19 06:10:00,624 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:10:00,624 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:10:00,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:10:00,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2024-11-19 06:10:00,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:10:00,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2024-11-19 06:10:01,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121876882] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:10:01,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:10:01,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 35 [2024-11-19 06:10:01,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216987515] [2024-11-19 06:10:01,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:10:01,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-19 06:10:01,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:10:01,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-19 06:10:01,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1464, Unknown=0, NotChecked=0, Total=1560 [2024-11-19 06:10:01,032 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 35 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 31 states have internal predecessors, (59), 5 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-19 06:10:02,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:10:02,626 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2024-11-19 06:10:02,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 06:10:02,626 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 31 states have internal predecessors, (59), 5 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 45 [2024-11-19 06:10:02,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:10:02,627 INFO L225 Difference]: With dead ends: 57 [2024-11-19 06:10:02,627 INFO L226 Difference]: Without dead ends: 57 [2024-11-19 06:10:02,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=326, Invalid=3214, Unknown=0, NotChecked=0, Total=3540 [2024-11-19 06:10:02,629 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 91 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:10:02,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 416 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 06:10:02,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-19 06:10:02,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2024-11-19 06:10:02,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 46 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 06:10:02,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2024-11-19 06:10:02,633 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 45 [2024-11-19 06:10:02,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:10:02,634 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2024-11-19 06:10:02,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 31 states have internal predecessors, (59), 5 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-19 06:10:02,634 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2024-11-19 06:10:02,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 06:10:02,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:10:02,635 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:10:02,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 06:10:02,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:10:02,837 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:10:02,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:10:02,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1876955208, now seen corresponding path program 1 times [2024-11-19 06:10:02,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:10:02,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006200515] [2024-11-19 06:10:02,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:10:02,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:10:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:10:03,752 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 25 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 06:10:03,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:10:03,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006200515] [2024-11-19 06:10:03,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006200515] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:10:03,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261857244] [2024-11-19 06:10:03,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:10:03,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:10:03,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:10:03,754 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:10:03,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 06:10:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:10:03,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-19 06:10:03,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:10:03,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:10:03,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:10:03,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 06:10:03,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2024-11-19 06:10:04,068 INFO L349 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2024-11-19 06:10:04,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 28 [2024-11-19 06:10:04,079 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-19 06:10:04,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-19 06:10:04,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 06:10:04,200 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-19 06:10:04,200 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 15 [2024-11-19 06:10:04,204 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 23 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:10:04,204 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:10:04,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:10:04,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2024-11-19 06:10:04,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261857244] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:10:04,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:10:04,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2024-11-19 06:10:04,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577201595] [2024-11-19 06:10:04,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:10:04,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 06:10:04,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:10:04,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 06:10:04,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2024-11-19 06:10:04,380 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 20 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 06:10:05,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:10:05,174 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2024-11-19 06:10:05,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 06:10:05,175 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 20 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 45 [2024-11-19 06:10:05,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:10:05,176 INFO L225 Difference]: With dead ends: 67 [2024-11-19 06:10:05,176 INFO L226 Difference]: Without dead ends: 67 [2024-11-19 06:10:05,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=314, Invalid=1848, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 06:10:05,177 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 121 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:10:05,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 305 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:10:05,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-19 06:10:05,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2024-11-19 06:10:05,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:10:05,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2024-11-19 06:10:05,181 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 45 [2024-11-19 06:10:05,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:10:05,181 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2024-11-19 06:10:05,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 20 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 06:10:05,181 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2024-11-19 06:10:05,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 06:10:05,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:10:05,182 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:10:05,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 06:10:05,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:10:05,385 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:10:05,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:10:05,386 INFO L85 PathProgramCache]: Analyzing trace with hash 42568108, now seen corresponding path program 3 times [2024-11-19 06:10:05,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:10:05,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802117656] [2024-11-19 06:10:05,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:10:05,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:10:05,415 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-19 06:10:05,415 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 06:10:05,416 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 06:10:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:10:05,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 06:10:05,462 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 06:10:05,463 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-19 06:10:05,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-19 06:10:05,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:10:05,468 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2024-11-19 06:10:05,508 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 06:10:05,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:10:05 BoogieIcfgContainer [2024-11-19 06:10:05,511 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 06:10:05,511 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 06:10:05,511 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 06:10:05,512 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 06:10:05,512 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:09:51" (3/4) ... [2024-11-19 06:10:05,513 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 06:10:05,562 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 06:10:05,564 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 06:10:05,565 INFO L158 Benchmark]: Toolchain (without parser) took 15354.64ms. Allocated memory was 159.4MB in the beginning and 429.9MB in the end (delta: 270.5MB). Free memory was 104.0MB in the beginning and 222.2MB in the end (delta: -118.3MB). Peak memory consumption was 155.4MB. Max. memory is 16.1GB. [2024-11-19 06:10:05,565 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 159.4MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:10:05,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.91ms. Allocated memory is still 159.4MB. Free memory was 104.0MB in the beginning and 84.2MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-19 06:10:05,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.16ms. Allocated memory is still 159.4MB. Free memory was 84.2MB in the beginning and 82.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:10:05,565 INFO L158 Benchmark]: Boogie Preprocessor took 39.09ms. Allocated memory is still 159.4MB. Free memory was 82.6MB in the beginning and 80.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:10:05,565 INFO L158 Benchmark]: RCFGBuilder took 384.09ms. Allocated memory is still 159.4MB. Free memory was 80.0MB in the beginning and 65.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 06:10:05,565 INFO L158 Benchmark]: TraceAbstraction took 14455.80ms. Allocated memory was 159.4MB in the beginning and 429.9MB in the end (delta: 270.5MB). Free memory was 64.5MB in the beginning and 225.4MB in the end (delta: -160.9MB). Peak memory consumption was 111.4MB. Max. memory is 16.1GB. [2024-11-19 06:10:05,565 INFO L158 Benchmark]: Witness Printer took 52.77ms. Allocated memory is still 429.9MB. Free memory was 225.4MB in the beginning and 222.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 06:10:05,568 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.25ms. Allocated memory is still 159.4MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.91ms. Allocated memory is still 159.4MB. Free memory was 104.0MB in the beginning and 84.2MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.16ms. Allocated memory is still 159.4MB. Free memory was 84.2MB in the beginning and 82.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.09ms. Allocated memory is still 159.4MB. Free memory was 82.6MB in the beginning and 80.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 384.09ms. Allocated memory is still 159.4MB. Free memory was 80.0MB in the beginning and 65.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14455.80ms. Allocated memory was 159.4MB in the beginning and 429.9MB in the end (delta: 270.5MB). Free memory was 64.5MB in the beginning and 225.4MB in the end (delta: -160.9MB). Peak memory consumption was 111.4MB. Max. memory is 16.1GB. * Witness Printer took 52.77ms. Allocated memory is still 429.9MB. Free memory was 225.4MB in the beginning and 222.2MB in the end (delta: 3.2MB). 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: [L533] mlist *head; VAL [head={0:0}] [L554] int i; [L555] mlist *mylist, *temp; VAL [head={0:0}] [L556] CALL insert_list(mylist,2) VAL [\old(k)=2, head={0:0}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(k)=2, head={0:0}, k=2, l={-1:0}] [L544] COND TRUE head==((void *)0) [L545] l->next = ((void *)0) VAL [\old(k)=2, head={0:0}, k=2, l={-1:0}] [L550] head = l [L551] return 0; VAL [\old(k)=2, \result=0, head={-1:0}, k=2] [L556] RET insert_list(mylist,2) VAL [head={-1:0}, mylist={58:68}] [L557] CALL insert_list(mylist,5) VAL [\old(k)=5, head={-1:0}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(k)=5, head={-1:0}, k=5, l={-5:0}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\old(k)=5, head={-1:0}, l={-5:0}] [L550] head = l [L551] return 0; VAL [\old(k)=5, \result=0, head={-5:0}] [L557] RET insert_list(mylist,5) VAL [head={-5:0}, mylist={58:68}] [L558] CALL insert_list(mylist,1) VAL [\old(k)=1, head={-5:0}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(k)=1, head={-5:0}, k=1, l={-3:0}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\old(k)=1, head={-5:0}, l={-3:0}] [L550] head = l [L551] return 0; VAL [\old(k)=1, \result=0, head={-3:0}] [L558] RET insert_list(mylist,1) VAL [head={-3:0}, mylist={58:68}] [L559] CALL insert_list(mylist,3) VAL [\old(k)=3, head={-3:0}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(k)=3, head={-3:0}, k=3, l={-4:0}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\old(k)=3, head={-3:0}, l={-4:0}] [L550] head = l [L551] return 0; VAL [\old(k)=3, \result=0, head={-4:0}] [L559] RET insert_list(mylist,3) VAL [head={-4:0}, mylist={58:68}] [L560] CALL, EXPR search_list(head,2) [L535] l = head VAL [head={-4:0}, k=2, l={-4:0}] [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-4:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-4:0}] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-3:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-3:0}] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-5:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-5:0}] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-1:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [head={-4:0}, k=2, l={-1:0}] [L536] COND FALSE !(l!=((void *)0) && l->key!=k) [L539] return l; VAL [\result={-1:0}, head={-4:0}, k=2] [L560] RET, EXPR search_list(head,2) [L560] temp = search_list(head,2) [L561] EXPR temp->key [L561] CALL __VERIFIER_assert(temp->key==1) [L14] COND TRUE !(cond) VAL [head={-4:0}] [L15] CALL reach_error() [L12] COND FALSE !(0) VAL [head={-4:0}] [L12] __assert_fail ("0", "list_search-1.c", 3, __extension__ __PRETTY_FUNCTION__) VAL [head={-4:0}] - UnprovableResult [Line: 553]: 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 2 procedures, 32 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 14.3s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 401 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 401 mSDsluCounter, 1546 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1337 mSDsCounter, 152 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1987 IncrementalHoareTripleChecker+Invalid, 2139 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 152 mSolverCounterUnsat, 209 mSDtfsCounter, 1987 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 514 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1483 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=8, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 20 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 628 NumberOfCodeBlocks, 628 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 608 ConstructedInterpolants, 8 QuantifiedInterpolants, 6390 SizeOfPredicates, 33 NumberOfNonLiveVariables, 2349 ConjunctsInSsa, 252 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 370/504 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-19 06:10:05,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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)