./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 33d006375056e7e3c58d58b776bed0fedce081ec4ff9e691f038a741177fe7dd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:36:14,126 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:36:14,189 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-13 10:36:14,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:36:14,195 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:36:14,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:36:14,226 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:36:14,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:36:14,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:36:14,227 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:36:14,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:36:14,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:36:14,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:36:14,229 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:36:14,231 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:36:14,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:36:14,233 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:36:14,236 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:36:14,236 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:36:14,237 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:36:14,237 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:36:14,238 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:36:14,238 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:36:14,238 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:36:14,238 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:36:14,238 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:36:14,239 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:36:14,239 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:36:14,239 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:36:14,239 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:36:14,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:36:14,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:36:14,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:36:14,240 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:36:14,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:36:14,241 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:36:14,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:36:14,244 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:36:14,244 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:36:14,244 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 33d006375056e7e3c58d58b776bed0fedce081ec4ff9e691f038a741177fe7dd [2024-10-13 10:36:14,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:36:14,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:36:14,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:36:14,531 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:36:14,531 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:36:14,533 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i [2024-10-13 10:36:15,961 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:36:16,124 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:36:16,124 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i [2024-10-13 10:36:16,130 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1407aad98/aae6a5026b634f90b1a9e6ed5d4f4e37/FLAG34360eb93 [2024-10-13 10:36:16,144 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1407aad98/aae6a5026b634f90b1a9e6ed5d4f4e37 [2024-10-13 10:36:16,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:36:16,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:36:16,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:36:16,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:36:16,156 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:36:16,157 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:36:16" (1/1) ... [2024-10-13 10:36:16,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@98c2914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:16, skipping insertion in model container [2024-10-13 10:36:16,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:36:16" (1/1) ... [2024-10-13 10:36:16,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:36:16,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:36:16,352 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:36:16,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:36:16,384 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:36:16,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:16 WrapperNode [2024-10-13 10:36:16,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:36:16,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:36:16,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:36:16,386 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:36:16,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:16" (1/1) ... [2024-10-13 10:36:16,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:16" (1/1) ... [2024-10-13 10:36:16,417 INFO L138 Inliner]: procedures = 11, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2024-10-13 10:36:16,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:36:16,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:36:16,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:36:16,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:36:16,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:16" (1/1) ... [2024-10-13 10:36:16,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:16" (1/1) ... [2024-10-13 10:36:16,432 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:16" (1/1) ... [2024-10-13 10:36:16,448 INFO L175 MemorySlicer]: Split 5 memory accesses to 1 slices as follows [5]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-10-13 10:36:16,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:16" (1/1) ... [2024-10-13 10:36:16,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:16" (1/1) ... [2024-10-13 10:36:16,455 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:16" (1/1) ... [2024-10-13 10:36:16,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:16" (1/1) ... [2024-10-13 10:36:16,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:16" (1/1) ... [2024-10-13 10:36:16,464 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:16" (1/1) ... [2024-10-13 10:36:16,466 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:36:16,467 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:36:16,467 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:36:16,467 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:36:16,468 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:16" (1/1) ... [2024-10-13 10:36:16,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:36:16,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:36:16,500 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-10-13 10:36:16,502 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-10-13 10:36:16,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 10:36:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2024-10-13 10:36:16,546 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2024-10-13 10:36:16,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:36:16,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:36:16,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:36:16,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 10:36:16,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:36:16,651 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:36:16,653 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:36:16,800 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-10-13 10:36:16,803 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:36:16,842 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:36:16,842 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 10:36:16,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:36:16 BoogieIcfgContainer [2024-10-13 10:36:16,843 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:36:16,845 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:36:16,847 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:36:16,850 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:36:16,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:36:16" (1/3) ... [2024-10-13 10:36:16,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a22647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:36:16, skipping insertion in model container [2024-10-13 10:36:16,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:16" (2/3) ... [2024-10-13 10:36:16,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a22647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:36:16, skipping insertion in model container [2024-10-13 10:36:16,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:36:16" (3/3) ... [2024-10-13 10:36:16,854 INFO L112 eAbstractionObserver]: Analyzing ICFG rec_malloc_ex3.i [2024-10-13 10:36:16,871 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:36:16,871 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-10-13 10:36:16,919 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:36:16,927 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;@34efb8e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:36:16,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-10-13 10:36:16,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 16 states have (on average 2.0625) internal successors, (33), 30 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:36:16,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 10:36:16,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:16,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 10:36:16,939 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-13 10:36:16,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:16,945 INFO L85 PathProgramCache]: Analyzing trace with hash 88989, now seen corresponding path program 1 times [2024-10-13 10:36:16,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:16,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73178496] [2024-10-13 10:36:16,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:16,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:36:17,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:17,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73178496] [2024-10-13 10:36:17,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73178496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:36:17,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:36:17,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:36:17,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523710140] [2024-10-13 10:36:17,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:36:17,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 10:36:17,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:17,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 10:36:17,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 10:36:17,141 INFO L87 Difference]: Start difference. First operand has 34 states, 16 states have (on average 2.0625) internal successors, (33), 30 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:36:17,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:17,172 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2024-10-13 10:36:17,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 10:36:17,175 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-13 10:36:17,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:17,180 INFO L225 Difference]: With dead ends: 34 [2024-10-13 10:36:17,180 INFO L226 Difference]: Without dead ends: 33 [2024-10-13 10:36:17,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 10:36:17,185 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:17,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:36:17,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-13 10:36:17,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-13 10:36:17,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 16 states have (on average 1.9375) internal successors, (31), 29 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:36:17,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2024-10-13 10:36:17,220 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 3 [2024-10-13 10:36:17,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:17,220 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-10-13 10:36:17,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:36:17,221 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2024-10-13 10:36:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 10:36:17,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:17,221 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 10:36:17,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:36:17,222 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-13 10:36:17,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:17,223 INFO L85 PathProgramCache]: Analyzing trace with hash 88679, now seen corresponding path program 1 times [2024-10-13 10:36:17,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:17,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985846397] [2024-10-13 10:36:17,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:17,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:17,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:36:17,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:17,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985846397] [2024-10-13 10:36:17,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985846397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:36:17,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:36:17,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:36:17,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819264537] [2024-10-13 10:36:17,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:36:17,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:36:17,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:17,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:36:17,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:36:17,274 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:36:17,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:17,333 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2024-10-13 10:36:17,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:36:17,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-13 10:36:17,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:17,335 INFO L225 Difference]: With dead ends: 35 [2024-10-13 10:36:17,335 INFO L226 Difference]: Without dead ends: 34 [2024-10-13 10:36:17,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:36:17,337 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:17,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:36:17,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-13 10:36:17,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-13 10:36:17,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 30 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:36:17,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2024-10-13 10:36:17,345 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 3 [2024-10-13 10:36:17,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:17,346 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2024-10-13 10:36:17,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:36:17,346 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2024-10-13 10:36:17,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 10:36:17,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:17,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 10:36:17,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:36:17,347 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-13 10:36:17,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:17,348 INFO L85 PathProgramCache]: Analyzing trace with hash 88733, now seen corresponding path program 1 times [2024-10-13 10:36:17,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:17,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151467420] [2024-10-13 10:36:17,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:17,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:17,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:36:17,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:17,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151467420] [2024-10-13 10:36:17,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151467420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:36:17,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:36:17,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:36:17,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613961330] [2024-10-13 10:36:17,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:36:17,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:36:17,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:17,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:36:17,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:36:17,467 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:36:17,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:17,502 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2024-10-13 10:36:17,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:36:17,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-13 10:36:17,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:17,503 INFO L225 Difference]: With dead ends: 33 [2024-10-13 10:36:17,503 INFO L226 Difference]: Without dead ends: 33 [2024-10-13 10:36:17,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:36:17,505 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:17,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 44 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:36:17,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-13 10:36:17,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-13 10:36:17,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 29 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:36:17,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2024-10-13 10:36:17,510 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 3 [2024-10-13 10:36:17,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:17,510 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-10-13 10:36:17,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:36:17,511 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2024-10-13 10:36:17,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 10:36:17,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:17,511 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 10:36:17,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:36:17,511 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-13 10:36:17,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:17,512 INFO L85 PathProgramCache]: Analyzing trace with hash 88734, now seen corresponding path program 1 times [2024-10-13 10:36:17,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:17,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200243192] [2024-10-13 10:36:17,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:17,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:36:17,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:17,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200243192] [2024-10-13 10:36:17,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200243192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:36:17,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:36:17,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:36:17,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100837081] [2024-10-13 10:36:17,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:36:17,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:36:17,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:17,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:36:17,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:36:17,628 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:36:17,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:17,651 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-10-13 10:36:17,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:36:17,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-13 10:36:17,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:17,652 INFO L225 Difference]: With dead ends: 32 [2024-10-13 10:36:17,652 INFO L226 Difference]: Without dead ends: 32 [2024-10-13 10:36:17,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:36:17,654 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:17,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 47 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:36:17,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-13 10:36:17,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-13 10:36:17,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 28 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:36:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2024-10-13 10:36:17,659 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 3 [2024-10-13 10:36:17,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:17,659 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-10-13 10:36:17,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:36:17,659 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2024-10-13 10:36:17,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:36:17,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:17,660 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:36:17,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:36:17,660 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-13 10:36:17,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:17,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1650873816, now seen corresponding path program 1 times [2024-10-13 10:36:17,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:17,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064917676] [2024-10-13 10:36:17,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:17,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:36:17,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:17,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064917676] [2024-10-13 10:36:17,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064917676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:36:17,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:36:17,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:36:17,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277446825] [2024-10-13 10:36:17,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:36:17,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:36:17,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:17,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:36:17,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:36:17,786 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:36:17,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:17,869 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2024-10-13 10:36:17,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:36:17,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-13 10:36:17,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:17,870 INFO L225 Difference]: With dead ends: 27 [2024-10-13 10:36:17,870 INFO L226 Difference]: Without dead ends: 27 [2024-10-13 10:36:17,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:36:17,872 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 24 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:17,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 32 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:36:17,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-13 10:36:17,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-13 10:36:17,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 23 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:36:17,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-10-13 10:36:17,876 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 6 [2024-10-13 10:36:17,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:17,876 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-10-13 10:36:17,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:36:17,877 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-10-13 10:36:17,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:36:17,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:17,877 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:36:17,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:36:17,878 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-13 10:36:17,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:17,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1650873815, now seen corresponding path program 1 times [2024-10-13 10:36:17,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:17,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42733228] [2024-10-13 10:36:17,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:17,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:18,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:36:18,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:18,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42733228] [2024-10-13 10:36:18,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42733228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:36:18,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:36:18,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:36:18,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546595924] [2024-10-13 10:36:18,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:36:18,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:36:18,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:18,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:36:18,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:36:18,021 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:36:18,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:18,104 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2024-10-13 10:36:18,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:36:18,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-13 10:36:18,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:18,107 INFO L225 Difference]: With dead ends: 24 [2024-10-13 10:36:18,107 INFO L226 Difference]: Without dead ends: 24 [2024-10-13 10:36:18,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:36:18,108 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:18,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 31 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:36:18,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-13 10:36:18,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-10-13 10:36:18,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:36:18,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-10-13 10:36:18,116 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 6 [2024-10-13 10:36:18,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:18,116 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-10-13 10:36:18,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:36:18,117 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-10-13 10:36:18,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:36:18,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:18,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:18,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:36:18,118 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting recErr5ASSERT_VIOLATIONMEMORY_FREE === [recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-13 10:36:18,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:18,120 INFO L85 PathProgramCache]: Analyzing trace with hash -2032281635, now seen corresponding path program 1 times [2024-10-13 10:36:18,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:18,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914904966] [2024-10-13 10:36:18,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:18,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:18,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:36:18,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:18,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914904966] [2024-10-13 10:36:18,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914904966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:36:18,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:36:18,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:36:18,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280616428] [2024-10-13 10:36:18,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:36:18,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:36:18,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:18,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:36:18,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:36:18,210 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:36:18,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:18,275 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2024-10-13 10:36:18,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:36:18,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 10:36:18,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:18,277 INFO L225 Difference]: With dead ends: 23 [2024-10-13 10:36:18,277 INFO L226 Difference]: Without dead ends: 23 [2024-10-13 10:36:18,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:36:18,278 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:18,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 27 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:36:18,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-13 10:36:18,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-10-13 10:36:18,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:36:18,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-10-13 10:36:18,282 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 10 [2024-10-13 10:36:18,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:18,282 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-10-13 10:36:18,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:36:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-10-13 10:36:18,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 10:36:18,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:18,283 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:18,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:36:18,284 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-13 10:36:18,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:18,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2055586900, now seen corresponding path program 1 times [2024-10-13 10:36:18,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:18,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134914325] [2024-10-13 10:36:18,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:18,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:18,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-13 10:36:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:36:18,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:18,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134914325] [2024-10-13 10:36:18,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134914325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:36:18,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:36:18,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:36:18,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713320362] [2024-10-13 10:36:18,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:36:18,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:36:18,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:18,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:36:18,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:36:18,489 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:36:18,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:18,565 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2024-10-13 10:36:18,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:36:18,567 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-13 10:36:18,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:18,567 INFO L225 Difference]: With dead ends: 20 [2024-10-13 10:36:18,567 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 10:36:18,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:36:18,568 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:18,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 36 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:36:18,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 10:36:18,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 10:36:18,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:36:18,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 10:36:18,572 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2024-10-13 10:36:18,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:18,572 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 10:36:18,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:36:18,573 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 10:36:18,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 10:36:18,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 14 remaining) [2024-10-13 10:36:18,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2024-10-13 10:36:18,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2024-10-13 10:36:18,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2024-10-13 10:36:18,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr4ASSERT_VIOLATIONMEMORY_FREE (9 of 14 remaining) [2024-10-13 10:36:18,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr5ASSERT_VIOLATIONMEMORY_FREE (8 of 14 remaining) [2024-10-13 10:36:18,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr6ASSERT_VIOLATIONMEMORY_FREE (7 of 14 remaining) [2024-10-13 10:36:18,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2024-10-13 10:36:18,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2024-10-13 10:36:18,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2024-10-13 10:36:18,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2024-10-13 10:36:18,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2024-10-13 10:36:18,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2024-10-13 10:36:18,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 14 remaining) [2024-10-13 10:36:18,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:36:18,583 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:18,585 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 10:36:18,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:36:18 BoogieIcfgContainer [2024-10-13 10:36:18,590 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 10:36:18,591 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 10:36:18,591 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 10:36:18,591 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 10:36:18,592 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:36:16" (3/4) ... [2024-10-13 10:36:18,594 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 10:36:18,600 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure rec [2024-10-13 10:36:18,606 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-13 10:36:18,606 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 10:36:18,606 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-13 10:36:18,606 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 10:36:18,690 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 10:36:18,690 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 10:36:18,690 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 10:36:18,691 INFO L158 Benchmark]: Toolchain (without parser) took 2542.17ms. Allocated memory is still 178.3MB. Free memory was 108.8MB in the beginning and 117.6MB in the end (delta: -8.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:36:18,691 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 178.3MB. Free memory is still 134.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:36:18,691 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.39ms. Allocated memory is still 178.3MB. Free memory was 108.6MB in the beginning and 97.2MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 10:36:18,691 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.53ms. Allocated memory is still 178.3MB. Free memory was 97.2MB in the beginning and 95.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:36:18,695 INFO L158 Benchmark]: Boogie Preprocessor took 47.01ms. Allocated memory is still 178.3MB. Free memory was 95.8MB in the beginning and 93.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:36:18,695 INFO L158 Benchmark]: RCFGBuilder took 376.36ms. Allocated memory is still 178.3MB. Free memory was 93.9MB in the beginning and 139.2MB in the end (delta: -45.3MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-10-13 10:36:18,696 INFO L158 Benchmark]: TraceAbstraction took 1745.16ms. Allocated memory is still 178.3MB. Free memory was 139.2MB in the beginning and 121.8MB in the end (delta: 17.5MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2024-10-13 10:36:18,696 INFO L158 Benchmark]: Witness Printer took 99.49ms. Allocated memory is still 178.3MB. Free memory was 121.8MB in the beginning and 117.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 10:36:18,697 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.19ms. Allocated memory is still 178.3MB. Free memory is still 134.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.39ms. Allocated memory is still 178.3MB. Free memory was 108.6MB in the beginning and 97.2MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.53ms. Allocated memory is still 178.3MB. Free memory was 97.2MB in the beginning and 95.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.01ms. Allocated memory is still 178.3MB. Free memory was 95.8MB in the beginning and 93.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 376.36ms. Allocated memory is still 178.3MB. Free memory was 93.9MB in the beginning and 139.2MB in the end (delta: -45.3MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1745.16ms. Allocated memory is still 178.3MB. Free memory was 139.2MB in the beginning and 121.8MB in the end (delta: 17.5MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * Witness Printer took 99.49ms. Allocated memory is still 178.3MB. Free memory was 121.8MB in the beginning and 117.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 11]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 11]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 80 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 77 mSDsluCounter, 296 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 131 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 254 IncrementalHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 165 mSDtfsCounter, 254 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 204 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 1/1 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 - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-13 10:36:18,731 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 Result: TRUE