./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/verifythis/tree_max.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/tree_max.c -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 e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:50:05,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:50:05,095 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-12 12:50:05,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:50:05,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:50:05,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:50:05,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:50:05,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:50:05,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 12:50:05,139 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 12:50:05,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:50:05,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:50:05,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:50:05,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:50:05,141 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:50:05,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:50:05,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:50:05,143 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:50:05,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:50:05,143 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:50:05,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:50:05,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:50:05,144 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 12:50:05,145 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 12:50:05,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:50:05,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:50:05,146 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 12:50:05,146 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:50:05,146 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:50:05,147 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:50:05,147 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:50:05,147 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:50:05,148 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:50:05,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:50:05,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 12:50:05,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:50:05,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:50:05,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:50:05,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:50:05,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:50:05,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:50:05,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:50:05,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:50:05,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:50:05,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:50:05,151 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 -> e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c [2024-11-12 12:50:05,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:50:05,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:50:05,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:50:05,432 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:50:05,432 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:50:05,434 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_max.c [2024-11-12 12:50:06,944 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:50:07,139 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:50:07,139 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max.c [2024-11-12 12:50:07,146 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9f4e83a2/146d98700666461aab7f02311042f0ed/FLAG8c76879fb [2024-11-12 12:50:07,513 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9f4e83a2/146d98700666461aab7f02311042f0ed [2024-11-12 12:50:07,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:50:07,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:50:07,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:50:07,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:50:07,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:50:07,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:50:07" (1/1) ... [2024-11-12 12:50:07,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e7ed0c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:07, skipping insertion in model container [2024-11-12 12:50:07,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:50:07" (1/1) ... [2024-11-12 12:50:07,551 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:50:07,739 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-12 12:50:07,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:50:07,765 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:50:07,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:50:07,808 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:50:07,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:07 WrapperNode [2024-11-12 12:50:07,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:50:07,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:50:07,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:50:07,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:50:07,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:07" (1/1) ... [2024-11-12 12:50:07,854 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:07" (1/1) ... [2024-11-12 12:50:07,884 INFO L138 Inliner]: procedures = 24, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 40 [2024-11-12 12:50:07,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:50:07,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:50:07,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:50:07,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:50:07,896 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:07" (1/1) ... [2024-11-12 12:50:07,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:07" (1/1) ... [2024-11-12 12:50:07,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:07" (1/1) ... [2024-11-12 12:50:07,922 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-11-12 12:50:07,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:07" (1/1) ... [2024-11-12 12:50:07,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:07" (1/1) ... [2024-11-12 12:50:07,932 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:07" (1/1) ... [2024-11-12 12:50:07,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:07" (1/1) ... [2024-11-12 12:50:07,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:07" (1/1) ... [2024-11-12 12:50:07,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:07" (1/1) ... [2024-11-12 12:50:07,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:50:07,942 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:50:07,943 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:50:07,944 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:50:07,946 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:07" (1/1) ... [2024-11-12 12:50:07,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:50:07,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:50:07,986 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 12:50:07,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 12:50:08,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 12:50:08,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 12:50:08,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:50:08,042 INFO L130 BoogieDeclarations]: Found specification of procedure max [2024-11-12 12:50:08,043 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2024-11-12 12:50:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2024-11-12 12:50:08,044 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2024-11-12 12:50:08,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 12:50:08,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 12:50:08,045 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-11-12 12:50:08,045 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-11-12 12:50:08,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 12:50:08,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 12:50:08,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 12:50:08,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 12:50:08,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 12:50:08,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:50:08,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:50:08,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 12:50:08,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 12:50:08,149 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:50:08,152 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:50:08,361 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-11-12 12:50:08,361 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:50:08,388 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:50:08,388 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 12:50:08,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:50:08 BoogieIcfgContainer [2024-11-12 12:50:08,389 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:50:08,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:50:08,391 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:50:08,396 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:50:08,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:50:07" (1/3) ... [2024-11-12 12:50:08,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a6e9af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:50:08, skipping insertion in model container [2024-11-12 12:50:08,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:07" (2/3) ... [2024-11-12 12:50:08,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a6e9af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:50:08, skipping insertion in model container [2024-11-12 12:50:08,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:50:08" (3/3) ... [2024-11-12 12:50:08,399 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_max.c [2024-11-12 12:50:08,417 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:50:08,417 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 12:50:08,467 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:50:08,474 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;@3b9c77ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:50:08,475 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 12:50:08,480 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 31 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 12:50:08,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 12:50:08,490 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:50:08,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:50:08,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:50:08,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:50:08,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1784882872, now seen corresponding path program 1 times [2024-11-12 12:50:08,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:50:08,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714687159] [2024-11-12 12:50:08,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:50:08,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:50:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:08,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:50:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:09,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 12:50:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:09,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:50:09,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:50:09,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714687159] [2024-11-12 12:50:09,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714687159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:50:09,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:50:09,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 12:50:09,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797411710] [2024-11-12 12:50:09,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:50:09,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 12:50:09,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:50:09,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 12:50:09,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 12:50:09,138 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 31 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 12:50:09,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:50:09,521 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2024-11-12 12:50:09,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 12:50:09,524 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-11-12 12:50:09,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:50:09,533 INFO L225 Difference]: With dead ends: 54 [2024-11-12 12:50:09,533 INFO L226 Difference]: Without dead ends: 52 [2024-11-12 12:50:09,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-12 12:50:09,539 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 35 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 12:50:09,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 118 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 12:50:09,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-12 12:50:09,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2024-11-12 12:50:09,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 35 states have internal predecessors, (40), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2024-11-12 12:50:09,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2024-11-12 12:50:09,584 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 19 [2024-11-12 12:50:09,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:50:09,586 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2024-11-12 12:50:09,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 12:50:09,586 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2024-11-12 12:50:09,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 12:50:09,588 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:50:09,589 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:50:09,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 12:50:09,589 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:50:09,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:50:09,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1558539456, now seen corresponding path program 1 times [2024-11-12 12:50:09,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:50:09,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454236445] [2024-11-12 12:50:09,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:50:09,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:50:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:09,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:50:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:09,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 12:50:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:09,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 12:50:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:09,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:50:09,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:50:09,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454236445] [2024-11-12 12:50:09,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454236445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:50:09,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:50:09,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 12:50:09,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049598629] [2024-11-12 12:50:09,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:50:09,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 12:50:09,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:50:09,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 12:50:09,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:50:09,734 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 12:50:09,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:50:09,857 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2024-11-12 12:50:09,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 12:50:09,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2024-11-12 12:50:09,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:50:09,859 INFO L225 Difference]: With dead ends: 53 [2024-11-12 12:50:09,859 INFO L226 Difference]: Without dead ends: 43 [2024-11-12 12:50:09,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:50:09,862 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 29 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 12:50:09,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 38 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 12:50:09,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-12 12:50:09,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-12 12:50:09,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.25) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-12 12:50:09,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2024-11-12 12:50:09,873 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 21 [2024-11-12 12:50:09,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:50:09,874 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2024-11-12 12:50:09,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 12:50:09,874 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2024-11-12 12:50:09,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-12 12:50:09,876 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:50:09,876 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2024-11-12 12:50:09,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 12:50:09,877 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:50:09,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:50:09,877 INFO L85 PathProgramCache]: Analyzing trace with hash -583725959, now seen corresponding path program 1 times [2024-11-12 12:50:09,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:50:09,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304851299] [2024-11-12 12:50:09,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:50:09,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:50:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:10,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:50:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:10,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:50:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:10,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 12:50:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:10,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 12:50:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:10,211 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 12:50:10,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:50:10,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304851299] [2024-11-12 12:50:10,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304851299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:50:10,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:50:10,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 12:50:10,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577405671] [2024-11-12 12:50:10,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:50:10,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 12:50:10,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:50:10,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 12:50:10,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 12:50:10,215 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 12:50:10,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:50:10,463 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2024-11-12 12:50:10,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 12:50:10,463 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2024-11-12 12:50:10,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:50:10,465 INFO L225 Difference]: With dead ends: 45 [2024-11-12 12:50:10,465 INFO L226 Difference]: Without dead ends: 45 [2024-11-12 12:50:10,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-12 12:50:10,466 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 31 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 12:50:10,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 128 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 12:50:10,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-12 12:50:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-12 12:50:10,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) [2024-11-12 12:50:10,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2024-11-12 12:50:10,475 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 31 [2024-11-12 12:50:10,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:50:10,475 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2024-11-12 12:50:10,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 12:50:10,476 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2024-11-12 12:50:10,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-12 12:50:10,477 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:50:10,479 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1] [2024-11-12 12:50:10,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 12:50:10,480 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:50:10,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:50:10,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1389688533, now seen corresponding path program 1 times [2024-11-12 12:50:10,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:50:10,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593938010] [2024-11-12 12:50:10,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:50:10,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:50:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:11,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:50:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:11,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:50:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:11,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 12:50:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:11,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 12:50:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:11,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:50:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:11,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 12:50:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:11,171 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-12 12:50:11,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:50:11,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593938010] [2024-11-12 12:50:11,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593938010] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:50:11,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576028682] [2024-11-12 12:50:11,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:50:11,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:50:11,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:50:11,176 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 12:50:11,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 12:50:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:11,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-12 12:50:11,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:50:11,413 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 8 treesize of output 1 [2024-11-12 12:50:11,671 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-12 12:50:11,700 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-12 12:50:11,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:50:11,958 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-12 12:50:11,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576028682] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:50:11,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 12:50:11,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 10] total 23 [2024-11-12 12:50:11,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400884701] [2024-11-12 12:50:11,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 12:50:11,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-12 12:50:11,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:50:11,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-12 12:50:11,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2024-11-12 12:50:11,962 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 23 states, 20 states have (on average 2.0) internal successors, (40), 17 states have internal predecessors, (40), 8 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-12 12:50:12,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:50:12,613 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2024-11-12 12:50:12,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 12:50:12,614 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.0) internal successors, (40), 17 states have internal predecessors, (40), 8 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) Word has length 44 [2024-11-12 12:50:12,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:50:12,617 INFO L225 Difference]: With dead ends: 56 [2024-11-12 12:50:12,617 INFO L226 Difference]: Without dead ends: 56 [2024-11-12 12:50:12,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 83 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2024-11-12 12:50:12,619 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 54 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 12:50:12,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 213 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 12:50:12,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-12 12:50:12,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-12 12:50:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 40 states have internal predecessors, (46), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2024-11-12 12:50:12,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2024-11-12 12:50:12,630 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 44 [2024-11-12 12:50:12,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:50:12,631 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2024-11-12 12:50:12,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.0) internal successors, (40), 17 states have internal predecessors, (40), 8 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-12 12:50:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2024-11-12 12:50:12,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-12 12:50:12,632 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:50:12,633 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:50:12,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 12:50:12,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:50:12,837 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:50:12,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:50:12,837 INFO L85 PathProgramCache]: Analyzing trace with hash 266098275, now seen corresponding path program 1 times [2024-11-12 12:50:12,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:50:12,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286661511] [2024-11-12 12:50:12,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:50:12,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:50:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:12,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:50:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:12,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:50:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:13,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 12:50:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:13,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 12:50:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:13,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:50:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:13,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 12:50:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:13,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 12:50:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:13,161 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-12 12:50:13,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:50:13,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286661511] [2024-11-12 12:50:13,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286661511] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:50:13,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829854557] [2024-11-12 12:50:13,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:50:13,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:50:13,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:50:13,167 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 12:50:13,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 12:50:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:13,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-12 12:50:13,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:50:13,336 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-12 12:50:13,336 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:50:13,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829854557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:50:13,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 12:50:13,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 16 [2024-11-12 12:50:13,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007350245] [2024-11-12 12:50:13,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:50:13,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 12:50:13,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:50:13,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 12:50:13,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2024-11-12 12:50:13,338 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-12 12:50:13,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:50:13,397 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2024-11-12 12:50:13,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 12:50:13,398 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2024-11-12 12:50:13,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:50:13,399 INFO L225 Difference]: With dead ends: 60 [2024-11-12 12:50:13,399 INFO L226 Difference]: Without dead ends: 58 [2024-11-12 12:50:13,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2024-11-12 12:50:13,400 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 5 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 12:50:13,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 296 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 12:50:13,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-12 12:50:13,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2024-11-12 12:50:13,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2024-11-12 12:50:13,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2024-11-12 12:50:13,411 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 46 [2024-11-12 12:50:13,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:50:13,411 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2024-11-12 12:50:13,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-12 12:50:13,412 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2024-11-12 12:50:13,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 12:50:13,413 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:50:13,415 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:50:13,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 12:50:13,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:50:13,616 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:50:13,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:50:13,616 INFO L85 PathProgramCache]: Analyzing trace with hash 358548016, now seen corresponding path program 1 times [2024-11-12 12:50:13,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:50:13,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647772976] [2024-11-12 12:50:13,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:50:13,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:50:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:14,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:50:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:14,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:50:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:14,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 12:50:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:14,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 12:50:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:14,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:50:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:14,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 12:50:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-12 12:50:14,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:50:14,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647772976] [2024-11-12 12:50:14,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647772976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:50:14,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487423445] [2024-11-12 12:50:14,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:50:14,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:50:14,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:50:14,235 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 12:50:14,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 12:50:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:14,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-12 12:50:14,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:50:14,388 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-12 12:50:14,394 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-12 12:50:14,799 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-12 12:50:14,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:50:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-12 12:50:14,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487423445] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:50:14,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 12:50:14,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 21 [2024-11-12 12:50:14,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924065179] [2024-11-12 12:50:14,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 12:50:14,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-12 12:50:14,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:50:14,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-12 12:50:14,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2024-11-12 12:50:14,953 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 21 states, 20 states have (on average 2.4) internal successors, (48), 13 states have internal predecessors, (48), 6 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (13), 9 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-12 12:50:15,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:50:15,738 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2024-11-12 12:50:15,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 12:50:15,739 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 13 states have internal predecessors, (48), 6 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (13), 9 states have call predecessors, (13), 5 states have call successors, (13) Word has length 50 [2024-11-12 12:50:15,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:50:15,740 INFO L225 Difference]: With dead ends: 108 [2024-11-12 12:50:15,740 INFO L226 Difference]: Without dead ends: 108 [2024-11-12 12:50:15,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2024-11-12 12:50:15,742 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 96 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 12:50:15,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 168 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 12:50:15,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-12 12:50:15,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 101. [2024-11-12 12:50:15,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 72 states have internal predecessors, (83), 19 states have call successors, (19), 8 states have call predecessors, (19), 12 states have return successors, (28), 20 states have call predecessors, (28), 19 states have call successors, (28) [2024-11-12 12:50:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 130 transitions. [2024-11-12 12:50:15,753 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 130 transitions. Word has length 50 [2024-11-12 12:50:15,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:50:15,754 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 130 transitions. [2024-11-12 12:50:15,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 13 states have internal predecessors, (48), 6 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (13), 9 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-12 12:50:15,754 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2024-11-12 12:50:15,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 12:50:15,756 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:50:15,756 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:50:15,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 12:50:15,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:50:15,961 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:50:15,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:50:15,962 INFO L85 PathProgramCache]: Analyzing trace with hash 242184370, now seen corresponding path program 1 times [2024-11-12 12:50:15,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:50:15,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884991244] [2024-11-12 12:50:15,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:50:15,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:50:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:16,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:50:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:16,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:50:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:16,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 12:50:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:16,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 12:50:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:16,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:50:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:16,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 12:50:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:16,622 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-12 12:50:16,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:50:16,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884991244] [2024-11-12 12:50:16,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884991244] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:50:16,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88145767] [2024-11-12 12:50:16,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:50:16,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:50:16,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:50:16,625 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 12:50:16,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 12:50:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:16,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-12 12:50:16,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:50:16,779 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-12 12:50:16,784 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-12 12:50:16,860 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 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-12 12:50:16,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-12 12:50:17,271 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-12 12:50:17,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:50:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-12 12:50:17,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88145767] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:50:17,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 12:50:17,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 14] total 30 [2024-11-12 12:50:17,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831449988] [2024-11-12 12:50:17,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 12:50:17,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-12 12:50:17,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:50:17,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-12 12:50:17,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=792, Unknown=0, NotChecked=0, Total=870 [2024-11-12 12:50:17,628 INFO L87 Difference]: Start difference. First operand 101 states and 130 transitions. Second operand has 30 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 22 states have internal predecessors, (63), 10 states have call successors, (19), 8 states have call predecessors, (19), 9 states have return successors, (16), 11 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-12 12:50:19,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:50:19,129 INFO L93 Difference]: Finished difference Result 206 states and 275 transitions. [2024-11-12 12:50:19,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-12 12:50:19,130 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 22 states have internal predecessors, (63), 10 states have call successors, (19), 8 states have call predecessors, (19), 9 states have return successors, (16), 11 states have call predecessors, (16), 8 states have call successors, (16) Word has length 50 [2024-11-12 12:50:19,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:50:19,133 INFO L225 Difference]: With dead ends: 206 [2024-11-12 12:50:19,133 INFO L226 Difference]: Without dead ends: 204 [2024-11-12 12:50:19,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=305, Invalid=2665, Unknown=0, NotChecked=0, Total=2970 [2024-11-12 12:50:19,135 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 123 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 12:50:19,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 408 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 12:50:19,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-12 12:50:19,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 197. [2024-11-12 12:50:19,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 135 states have (on average 1.2222222222222223) internal successors, (165), 140 states have internal predecessors, (165), 35 states have call successors, (35), 17 states have call predecessors, (35), 25 states have return successors, (68), 39 states have call predecessors, (68), 35 states have call successors, (68) [2024-11-12 12:50:19,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 268 transitions. [2024-11-12 12:50:19,165 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 268 transitions. Word has length 50 [2024-11-12 12:50:19,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:50:19,166 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 268 transitions. [2024-11-12 12:50:19,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 22 states have internal predecessors, (63), 10 states have call successors, (19), 8 states have call predecessors, (19), 9 states have return successors, (16), 11 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-12 12:50:19,169 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 268 transitions. [2024-11-12 12:50:19,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-12 12:50:19,172 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:50:19,172 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:50:19,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 12:50:19,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:50:19,381 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:50:19,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:50:19,381 INFO L85 PathProgramCache]: Analyzing trace with hash -677748063, now seen corresponding path program 2 times [2024-11-12 12:50:19,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:50:19,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376605331] [2024-11-12 12:50:19,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:50:19,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:50:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:19,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:50:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:20,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:50:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:20,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 12:50:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:20,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:50:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:20,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 12:50:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:20,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 12:50:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:20,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 12:50:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:20,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 12:50:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:20,359 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-12 12:50:20,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:50:20,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376605331] [2024-11-12 12:50:20,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376605331] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:50:20,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863222416] [2024-11-12 12:50:20,360 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 12:50:20,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:50:20,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:50:20,363 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-12 12:50:20,364 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-12 12:50:20,493 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 12:50:20,493 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 12:50:20,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-12 12:50:20,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:50:20,544 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 19 treesize of output 1 [2024-11-12 12:50:20,546 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-12 12:50:21,061 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-12 12:50:21,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:50:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-12 12:50:21,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863222416] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:50:21,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 12:50:21,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 19] total 44 [2024-11-12 12:50:21,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970650261] [2024-11-12 12:50:21,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 12:50:21,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-12 12:50:21,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:50:21,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-12 12:50:21,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1733, Unknown=0, NotChecked=0, Total=1892 [2024-11-12 12:50:21,552 INFO L87 Difference]: Start difference. First operand 197 states and 268 transitions. Second operand has 44 states, 37 states have (on average 2.054054054054054) internal successors, (76), 34 states have internal predecessors, (76), 15 states have call successors, (21), 7 states have call predecessors, (21), 12 states have return successors, (17), 16 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-12 12:50:22,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:50:22,555 INFO L93 Difference]: Finished difference Result 296 states and 406 transitions. [2024-11-12 12:50:22,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-12 12:50:22,556 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 37 states have (on average 2.054054054054054) internal successors, (76), 34 states have internal predecessors, (76), 15 states have call successors, (21), 7 states have call predecessors, (21), 12 states have return successors, (17), 16 states have call predecessors, (17), 11 states have call successors, (17) Word has length 62 [2024-11-12 12:50:22,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:50:22,558 INFO L225 Difference]: With dead ends: 296 [2024-11-12 12:50:22,558 INFO L226 Difference]: Without dead ends: 296 [2024-11-12 12:50:22,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=274, Invalid=3032, Unknown=0, NotChecked=0, Total=3306 [2024-11-12 12:50:22,563 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 91 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 12:50:22,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 362 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 12:50:22,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-12 12:50:22,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 241. [2024-11-12 12:50:22,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 167 states have (on average 1.215568862275449) internal successors, (203), 172 states have internal predecessors, (203), 41 states have call successors, (41), 21 states have call predecessors, (41), 31 states have return successors, (82), 47 states have call predecessors, (82), 41 states have call successors, (82) [2024-11-12 12:50:22,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 326 transitions. [2024-11-12 12:50:22,604 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 326 transitions. Word has length 62 [2024-11-12 12:50:22,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:50:22,605 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 326 transitions. [2024-11-12 12:50:22,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 37 states have (on average 2.054054054054054) internal successors, (76), 34 states have internal predecessors, (76), 15 states have call successors, (21), 7 states have call predecessors, (21), 12 states have return successors, (17), 16 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-12 12:50:22,605 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 326 transitions. [2024-11-12 12:50:22,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-12 12:50:22,610 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:50:22,610 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:50:22,628 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-12 12:50:22,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:50:22,811 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:50:22,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:50:22,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1572615861, now seen corresponding path program 1 times [2024-11-12 12:50:22,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:50:22,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653717013] [2024-11-12 12:50:22,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:50:22,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:50:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:50:22,828 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 12:50:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:50:22,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 12:50:22,867 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 12:50:22,868 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-12 12:50:22,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-12 12:50:22,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 12:50:22,872 INFO L421 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:50:22,907 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 12:50:22,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:50:22 BoogieIcfgContainer [2024-11-12 12:50:22,912 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 12:50:22,912 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 12:50:22,912 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 12:50:22,913 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 12:50:22,913 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:50:08" (3/4) ... [2024-11-12 12:50:22,914 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-12 12:50:22,968 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 12:50:22,968 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 12:50:22,969 INFO L158 Benchmark]: Toolchain (without parser) took 15451.73ms. Allocated memory was 153.1MB in the beginning and 283.1MB in the end (delta: 130.0MB). Free memory was 83.8MB in the beginning and 138.0MB in the end (delta: -54.2MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. [2024-11-12 12:50:22,969 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:50:22,969 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.95ms. Allocated memory is still 153.1MB. Free memory was 83.5MB in the beginning and 70.7MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 12:50:22,969 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.22ms. Allocated memory is still 153.1MB. Free memory was 70.7MB in the beginning and 125.6MB in the end (delta: -54.9MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2024-11-12 12:50:22,969 INFO L158 Benchmark]: Boogie Preprocessor took 54.95ms. Allocated memory is still 153.1MB. Free memory was 125.6MB in the beginning and 123.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 12:50:22,970 INFO L158 Benchmark]: RCFGBuilder took 446.60ms. Allocated memory is still 153.1MB. Free memory was 123.3MB in the beginning and 107.6MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 12:50:22,970 INFO L158 Benchmark]: TraceAbstraction took 14521.17ms. Allocated memory was 153.1MB in the beginning and 283.1MB in the end (delta: 130.0MB). Free memory was 107.1MB in the beginning and 140.1MB in the end (delta: -33.0MB). Peak memory consumption was 97.0MB. Max. memory is 16.1GB. [2024-11-12 12:50:22,970 INFO L158 Benchmark]: Witness Printer took 55.79ms. Allocated memory is still 283.1MB. Free memory was 140.1MB in the beginning and 138.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 12:50:22,972 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.16ms. Allocated memory is still 113.2MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.95ms. Allocated memory is still 153.1MB. Free memory was 83.5MB in the beginning and 70.7MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.22ms. Allocated memory is still 153.1MB. Free memory was 70.7MB in the beginning and 125.6MB in the end (delta: -54.9MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.95ms. Allocated memory is still 153.1MB. Free memory was 125.6MB in the beginning and 123.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 446.60ms. Allocated memory is still 153.1MB. Free memory was 123.3MB in the beginning and 107.6MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14521.17ms. Allocated memory was 153.1MB in the beginning and 283.1MB in the end (delta: 130.0MB). Free memory was 107.1MB in the beginning and 140.1MB in the end (delta: -33.0MB). Peak memory consumption was 97.0MB. Max. memory is 16.1GB. * Witness Printer took 55.79ms. Allocated memory is still 283.1MB. Free memory was 140.1MB in the beginning and 138.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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: 65]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L66] CALL, EXPR nondet_tree() [L24] COND FALSE !(__VERIFIER_nondet_bool()) [L27] struct node *n = (struct node *)malloc(sizeof(struct node)); [L28] n->data = __VERIFIER_nondet_int() [L29] CALL, EXPR nondet_tree() [L24] COND TRUE __VERIFIER_nondet_bool() [L25] return 0; VAL [\result={0:0}] [L29] RET, EXPR nondet_tree() VAL [n={-1:0}] [L29] n->left = nondet_tree() [L30] CALL, EXPR nondet_tree() [L24] COND TRUE __VERIFIER_nondet_bool() [L25] return 0; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [n={-1:0}] [L30] n->right = nondet_tree() [L31] return n; VAL [\result={-1:0}] [L66] RET, EXPR nondet_tree() [L66] CALL task(nondet_tree()) [L61] CALL, EXPR max(n) VAL [\old(n)={-1:0}] [L36] COND FALSE !(!n) [L39] EXPR n->data [L39] int a = n->data; [L40] EXPR n->left VAL [\old(n)={-1:0}, a=-2147483648, n={-1:0}] [L40] CALL, EXPR max(n->left) VAL [\old(n)={0:0}] [L36] COND TRUE !n [L37] return -2147483648; VAL [\old(n)={0:0}, \result=-2147483648] [L40] RET, EXPR max(n->left) VAL [\old(n)={-1:0}, a=-2147483648, n={-1:0}] [L40] int b = max(n->left); [L41] EXPR n->right VAL [\old(n)={-1:0}, a=-2147483648, b=-2147483648] [L41] CALL, EXPR max(n->right) VAL [\old(n)={0:0}] [L36] COND TRUE !n [L37] return -2147483648; VAL [\old(n)={0:0}, \result=-2147483648] [L41] RET, EXPR max(n->right) VAL [\old(n)={-1:0}, a=-2147483648, b=-2147483648] [L41] int c = max(n->right); [L42] COND TRUE b >= a && b >= c [L42] return b; VAL [\old(n)={-1:0}, \result=-2147483648] [L61] RET, EXPR max(n) VAL [n={-1:0}] [L61] int a = max(n); [L62] CALL check(n, a) [L49] COND TRUE \read(*n) [L50] EXPR n->data [L50] CALL __VERIFIER_assert(n->data <= a) [L15] COND FALSE !(!cond) [L50] RET __VERIFIER_assert(n->data <= a) [L52] COND FALSE !(__VERIFIER_nondet_bool()) [L55] EXPR n->right VAL [\old(a)=-2147483648, \old(n)={-1:0}, a=-2147483648] [L55] CALL check(n->right, a) VAL [\old(a)=-2147483648, \old(n)={0:0}] [L49] COND FALSE !(\read(*n)) [L55] RET check(n->right, a) VAL [\old(a)=-2147483648, \old(n)={-1:0}, a=-2147483648] [L62] RET check(n, a) VAL [a=-2147483648, n={-1:0}] [L66] RET task(nondet_tree()) - UnprovableResult [Line: 13]: 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 4 procedures, 44 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 14.4s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 500 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 464 mSDsluCounter, 1731 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1551 mSDsCounter, 176 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4320 IncrementalHoareTripleChecker+Invalid, 4496 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 176 mSolverCounterUnsat, 180 mSDtfsCounter, 4320 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 689 GetRequests, 480 SyntacticMatches, 9 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241occurred in iteration=8, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 72 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 630 NumberOfCodeBlocks, 630 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 764 ConstructedInterpolants, 65 QuantifiedInterpolants, 5296 SizeOfPredicates, 31 NumberOfNonLiveVariables, 1424 ConjunctsInSsa, 240 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 403/471 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-12 12:50:22,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)