./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0158-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0158-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be381633e08917ff7523167eb47da4558cd865b57872b34c3877295f48e457c8 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:43:24,219 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:43:24,299 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:43:24,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:43:24,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:43:24,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:43:24,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:43:24,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:43:24,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:43:24,339 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:43:24,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:43:24,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:43:24,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:43:24,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:43:24,345 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:43:24,346 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:43:24,346 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:43:24,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:43:24,346 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:43:24,347 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:43:24,347 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:43:24,347 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:43:24,348 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:43:24,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:43:24,348 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:43:24,349 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:43:24,349 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:43:24,350 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:43:24,350 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:43:24,351 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:43:24,351 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:43:24,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:43:24,352 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:43:24,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:43:24,352 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:43:24,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:43:24,353 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:43:24,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:43:24,353 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:43:24,353 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:43:24,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:43:24,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:43:24,354 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be381633e08917ff7523167eb47da4558cd865b57872b34c3877295f48e457c8 [2024-11-09 07:43:24,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:43:24,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:43:24,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:43:24,695 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:43:24,695 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:43:24,697 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0158-1.i [2024-11-09 07:43:26,123 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:43:26,370 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:43:26,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0158-1.i [2024-11-09 07:43:26,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ca7a49e/c2ed4c778b134d33b1bca84d8aae936c/FLAGfd22bb5d0 [2024-11-09 07:43:26,688 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ca7a49e/c2ed4c778b134d33b1bca84d8aae936c [2024-11-09 07:43:26,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:43:26,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:43:26,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:43:26,692 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:43:26,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:43:26,699 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:43:26" (1/1) ... [2024-11-09 07:43:26,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29b2e569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:26, skipping insertion in model container [2024-11-09 07:43:26,700 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:43:26" (1/1) ... [2024-11-09 07:43:26,755 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:43:27,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:43:27,087 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:43:27,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:43:27,172 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:43:27,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:27 WrapperNode [2024-11-09 07:43:27,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:43:27,173 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:43:27,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:43:27,174 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:43:27,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:27" (1/1) ... [2024-11-09 07:43:27,193 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:27" (1/1) ... [2024-11-09 07:43:27,212 INFO L138 Inliner]: procedures = 123, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25 [2024-11-09 07:43:27,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:43:27,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:43:27,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:43:27,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:43:27,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:27" (1/1) ... [2024-11-09 07:43:27,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:27" (1/1) ... [2024-11-09 07:43:27,229 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:27" (1/1) ... [2024-11-09 07:43:27,244 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-11-09 07:43:27,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:27" (1/1) ... [2024-11-09 07:43:27,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:27" (1/1) ... [2024-11-09 07:43:27,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:27" (1/1) ... [2024-11-09 07:43:27,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:27" (1/1) ... [2024-11-09 07:43:27,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:27" (1/1) ... [2024-11-09 07:43:27,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:27" (1/1) ... [2024-11-09 07:43:27,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:43:27,268 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:43:27,268 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:43:27,268 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:43:27,269 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:27" (1/1) ... [2024-11-09 07:43:27,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:43:27,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:43:27,305 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:43:27,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:43:27,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:43:27,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:43:27,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:43:27,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:43:27,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:43:27,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:43:27,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:43:27,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:43:27,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:43:27,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:43:27,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:43:27,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:43:27,475 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:43:27,478 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:43:27,583 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-09 07:43:27,583 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:43:27,593 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:43:27,593 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 07:43:27,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:43:27 BoogieIcfgContainer [2024-11-09 07:43:27,594 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:43:27,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:43:27,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:43:27,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:43:27,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:43:26" (1/3) ... [2024-11-09 07:43:27,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4df593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:43:27, skipping insertion in model container [2024-11-09 07:43:27,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:27" (2/3) ... [2024-11-09 07:43:27,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4df593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:43:27, skipping insertion in model container [2024-11-09 07:43:27,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:43:27" (3/3) ... [2024-11-09 07:43:27,603 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0158-1.i [2024-11-09 07:43:27,617 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:43:27,617 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-11-09 07:43:27,652 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:43:27,657 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;@4211413b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:43:27,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-09 07:43:27,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 21 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:27,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 07:43:27,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:27,664 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 07:43:27,665 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-09 07:43:27,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:27,669 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-09 07:43:27,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:27,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562725738] [2024-11-09 07:43:27,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:27,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:27,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:27,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:27,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562725738] [2024-11-09 07:43:27,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562725738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:27,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:27,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:43:27,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467202957] [2024-11-09 07:43:27,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:27,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:43:27,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:28,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:43:28,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:43:28,009 INFO L87 Difference]: Start difference. First operand has 22 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 21 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-11-09 07:43:28,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:28,064 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2024-11-09 07:43:28,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:43:28,067 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-11-09 07:43:28,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:28,074 INFO L225 Difference]: With dead ends: 19 [2024-11-09 07:43:28,074 INFO L226 Difference]: Without dead ends: 17 [2024-11-09 07:43:28,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:43:28,079 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:28,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 11 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:43:28,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-09 07:43:28,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-09 07:43:28,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.6) internal successors, (16), 16 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:28,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 16 transitions. [2024-11-09 07:43:28,109 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 16 transitions. Word has length 3 [2024-11-09 07:43:28,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:28,110 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 16 transitions. [2024-11-09 07:43:28,110 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-11-09 07:43:28,110 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2024-11-09 07:43:28,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 07:43:28,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:28,110 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 07:43:28,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:43:28,111 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-09 07:43:28,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:28,111 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-09 07:43:28,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:28,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122339789] [2024-11-09 07:43:28,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:28,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:28,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:28,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:28,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122339789] [2024-11-09 07:43:28,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122339789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:28,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:28,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:43:28,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280033057] [2024-11-09 07:43:28,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:28,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:43:28,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:28,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:43:28,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:43:28,284 INFO L87 Difference]: Start difference. First operand 17 states and 16 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-11-09 07:43:28,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:28,303 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2024-11-09 07:43:28,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:43:28,304 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-11-09 07:43:28,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:28,304 INFO L225 Difference]: With dead ends: 14 [2024-11-09 07:43:28,304 INFO L226 Difference]: Without dead ends: 14 [2024-11-09 07:43:28,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:43:28,306 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:28,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 16 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:43:28,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-09 07:43:28,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-09 07:43:28,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 13 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:28,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2024-11-09 07:43:28,309 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 3 [2024-11-09 07:43:28,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:28,310 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2024-11-09 07:43:28,310 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-11-09 07:43:28,310 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2024-11-09 07:43:28,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:43:28,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:28,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:28,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:43:28,311 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-09 07:43:28,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:28,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1803024996, now seen corresponding path program 1 times [2024-11-09 07:43:28,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:28,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9070415] [2024-11-09 07:43:28,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:28,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:28,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:28,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:28,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9070415] [2024-11-09 07:43:28,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9070415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:28,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:28,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:43:28,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663672526] [2024-11-09 07:43:28,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:28,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:43:28,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:28,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:43:28,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:43:28,513 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:28,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:28,542 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2024-11-09 07:43:28,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:43:28,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2024-11-09 07:43:28,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:28,545 INFO L225 Difference]: With dead ends: 13 [2024-11-09 07:43:28,546 INFO L226 Difference]: Without dead ends: 13 [2024-11-09 07:43:28,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:43:28,548 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:28,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:43:28,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-09 07:43:28,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-09 07:43:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.2) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:28,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 12 transitions. [2024-11-09 07:43:28,554 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 12 transitions. Word has length 7 [2024-11-09 07:43:28,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:28,555 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 12 transitions. [2024-11-09 07:43:28,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:28,555 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2024-11-09 07:43:28,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 07:43:28,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:28,555 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:28,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:43:28,556 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-09 07:43:28,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:28,558 INFO L85 PathProgramCache]: Analyzing trace with hash 59200074, now seen corresponding path program 1 times [2024-11-09 07:43:28,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:28,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879428339] [2024-11-09 07:43:28,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:28,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:28,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:28,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:28,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879428339] [2024-11-09 07:43:28,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879428339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:28,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:28,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:43:28,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514383072] [2024-11-09 07:43:28,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:28,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:43:28,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:28,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:43:28,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:43:28,776 INFO L87 Difference]: Start difference. First operand 13 states and 12 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:28,816 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2024-11-09 07:43:28,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:43:28,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 07:43:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:28,817 INFO L225 Difference]: With dead ends: 12 [2024-11-09 07:43:28,817 INFO L226 Difference]: Without dead ends: 12 [2024-11-09 07:43:28,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:43:28,818 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:28,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 11 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:43:28,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-09 07:43:28,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-09 07:43:28,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:28,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 11 transitions. [2024-11-09 07:43:28,821 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 11 transitions. Word has length 8 [2024-11-09 07:43:28,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:28,821 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 11 transitions. [2024-11-09 07:43:28,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:28,821 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2024-11-09 07:43:28,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:43:28,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:28,822 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:28,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:43:28,822 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-09 07:43:28,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:28,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1835202342, now seen corresponding path program 1 times [2024-11-09 07:43:28,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:28,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970256842] [2024-11-09 07:43:28,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:28,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:28,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:28,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:28,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970256842] [2024-11-09 07:43:28,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970256842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:28,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:28,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:43:28,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492014352] [2024-11-09 07:43:28,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:28,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:43:28,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:28,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:43:28,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:43:28,942 INFO L87 Difference]: Start difference. First operand 12 states and 11 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:28,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:28,973 INFO L93 Difference]: Finished difference Result 11 states and 10 transitions. [2024-11-09 07:43:28,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:43:28,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 07:43:28,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:28,975 INFO L225 Difference]: With dead ends: 11 [2024-11-09 07:43:28,976 INFO L226 Difference]: Without dead ends: 11 [2024-11-09 07:43:28,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:43:28,977 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:28,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:43:28,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-09 07:43:28,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-11-09 07:43:28,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.0) internal successors, (10), 10 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:28,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 10 transitions. [2024-11-09 07:43:28,984 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 10 transitions. Word has length 9 [2024-11-09 07:43:28,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:28,984 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 10 transitions. [2024-11-09 07:43:28,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:28,985 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 10 transitions. [2024-11-09 07:43:28,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:43:28,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:28,985 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:28,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:43:28,986 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-09 07:43:28,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:28,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1056697805, now seen corresponding path program 1 times [2024-11-09 07:43:28,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:28,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734107546] [2024-11-09 07:43:28,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:28,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:29,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:29,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:29,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734107546] [2024-11-09 07:43:29,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734107546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:29,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:29,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:43:29,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261324441] [2024-11-09 07:43:29,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:29,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:43:29,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:29,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:43:29,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:43:29,271 INFO L87 Difference]: Start difference. First operand 11 states and 10 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:29,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:29,306 INFO L93 Difference]: Finished difference Result 10 states and 9 transitions. [2024-11-09 07:43:29,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:43:29,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 07:43:29,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:29,307 INFO L225 Difference]: With dead ends: 10 [2024-11-09 07:43:29,307 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 07:43:29,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:43:29,309 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:29,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:43:29,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 07:43:29,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 07:43:29,310 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-11-09 07:43:29,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 07:43:29,310 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2024-11-09 07:43:29,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:29,311 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 07:43:29,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:29,311 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 07:43:29,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 07:43:29,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 10 remaining) [2024-11-09 07:43:29,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2024-11-09 07:43:29,315 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2024-11-09 07:43:29,315 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2024-11-09 07:43:29,315 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2024-11-09 07:43:29,315 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2024-11-09 07:43:29,315 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (3 of 10 remaining) [2024-11-09 07:43:29,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (2 of 10 remaining) [2024-11-09 07:43:29,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (1 of 10 remaining) [2024-11-09 07:43:29,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2024-11-09 07:43:29,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:43:29,319 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-09 07:43:29,321 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:43:29,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:43:29 BoogieIcfgContainer [2024-11-09 07:43:29,326 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:43:29,326 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:43:29,326 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:43:29,326 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:43:29,328 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:43:27" (3/4) ... [2024-11-09 07:43:29,331 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 07:43:29,339 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-09 07:43:29,339 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 07:43:29,339 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 07:43:29,339 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 07:43:29,411 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 07:43:29,412 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 07:43:29,412 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:43:29,412 INFO L158 Benchmark]: Toolchain (without parser) took 2721.18ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 130.4MB in the beginning and 85.6MB in the end (delta: 44.8MB). Peak memory consumption was 78.3MB. Max. memory is 16.1GB. [2024-11-09 07:43:29,412 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 161.5MB. Free memory was 126.8MB in the beginning and 126.6MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:43:29,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 480.53ms. Allocated memory is still 161.5MB. Free memory was 129.5MB in the beginning and 111.5MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 07:43:29,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.45ms. Allocated memory is still 161.5MB. Free memory was 110.7MB in the beginning and 109.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:43:29,413 INFO L158 Benchmark]: Boogie Preprocessor took 52.31ms. Allocated memory is still 161.5MB. Free memory was 109.4MB in the beginning and 107.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:43:29,414 INFO L158 Benchmark]: RCFGBuilder took 326.28ms. Allocated memory is still 161.5MB. Free memory was 107.7MB in the beginning and 123.6MB in the end (delta: -15.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 07:43:29,414 INFO L158 Benchmark]: TraceAbstraction took 1729.99ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 122.4MB in the beginning and 89.8MB in the end (delta: 32.6MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-11-09 07:43:29,414 INFO L158 Benchmark]: Witness Printer took 85.49ms. Allocated memory is still 195.0MB. Free memory was 89.8MB in the beginning and 85.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:43:29,416 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.57ms. Allocated memory is still 161.5MB. Free memory was 126.8MB in the beginning and 126.6MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 480.53ms. Allocated memory is still 161.5MB. Free memory was 129.5MB in the beginning and 111.5MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.45ms. Allocated memory is still 161.5MB. Free memory was 110.7MB in the beginning and 109.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.31ms. Allocated memory is still 161.5MB. Free memory was 109.4MB in the beginning and 107.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 326.28ms. Allocated memory is still 161.5MB. Free memory was 107.7MB in the beginning and 123.6MB in the end (delta: -15.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1729.99ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 122.4MB in the beginning and 89.8MB in the end (delta: 32.6MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Witness Printer took 85.49ms. Allocated memory is still 195.0MB. Free memory was 89.8MB in the beginning and 85.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: -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: 535]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 535]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 535]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 523]: 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 1 procedures, 22 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 118 IncrementalHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 42 mSDtfsCounter, 118 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 27, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 261 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 07:43:29,445 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